Grindelwald Photofit

The Ministry of Magic wants to put Grindelwald's photofit on the city's main electronic display. They ran into trouble with this.

The electronic photofit is a table $p$ with $n$ rows and $m$ columns. Each cell $p_{i,j}$ is the color of the pixel at row $i$, column $j$: R (red), G (green), B (blue), or . if the pixel must be left unpainted.

The display is also $n \times m$, but it is old. Each pixel $(i, j)$ has a restriction $c_{i,j}$:

• $c_{i,j} = 0$: the pixel is broken and can only be left unpainted.
• $c_{i,j} = 1$: the pixel can only be painted red or left unpainted.
• $c_{i,j} = 2$: the pixel can only be painted green or left unpainted.
• $c_{i,j} = 3$: the pixel can be painted red or green, or left unpainted.
• $c_{i,j} = 4$: the pixel can only be painted blue or left unpainted.
• $c_{i,j} = 5$: the pixel can be painted red or blue, or left unpainted.
• $c_{i,j} = 6$: the pixel can be painted green or blue, or left unpainted.
• $c_{i,j} = 7$: the pixel can be painted red, green, or blue, or left unpainted.

The Ministry needs to determine whether the photofit can be placed on the display while satisfying all restrictions. Help them.

The first line contains two integers $n$ and $m$ separated by a space ($1 \le n, m \le 100$), the number of rows and columns.

The next $n$ lines each contain a string of $m$ characters. The $j$-th character of the $i$-th line is $p_{i,j}$ ($p_{i,j} \in \{., R, G, B\}$).

After that, the next $n$ lines each contain a string of $m$ characters. The $j$-th character of the $i$-th line is $c_{i,j}$ ($0 \le c_{i,j} \le 7$).

Print correct if the photofit $p$ satisfies all restrictions $c$. Otherwise, print incorrect.