시간 제한 메모리 제한 제출 정답 맞은 사람 정답 비율
1 초 512 MB 20 3 3 18.750%

## 문제

Émile's dreams often feature people or animals who become distorted into others. Émile would like to show the enchanting world of his dreams to everybody by creating the very first animated cartoon, in black and white of course. After waking up, Émile only remembers the initial and final forms appearing in his dream, not the transformation itself, so he's asking you to reproduce these "morphings" by detailing the steps taken for transforming the first image into the second.

The images in Émile's dreams are not just any black and white image, they respect the following three constraints. First, all pixels on the border of the image -- the leftmost and righmost columns, and the top and the bottom rows -- have the same color. Second, the image does not contain any $2 \times 2$ square of the form  or .

The third constraint is more complex, and can be described as follows. Let us subdivide the image into regions, which are defined as the connected monochromatic areas of the image, i.e., they form the finest partition of the pixels such that any two adjacent pixels of the same color are in the same region. Two regions are considered adjacent if they contain adjacent pixels. In Émile's images, every region is adjacent to at most two other regions, and the region containing border pixels is adjacent to at most one other region.

You are given two black and white images of the same size $W \times H$, and your goal is to find a "morphing" transforming the first image into the second one. A morphing from image $A$ to image $B$ is a sequence of images starting with $A$ and ending with $B$ such that:

• each image (except the first) can be obtained from the previous one by flipping one bit;
• each image respects the three above constraints;
• the number of regions of each color does not change during the morphing.

## 입력

The first line of the input contains two space-separated integers: $W$ and $H$. Then come $H$ lines that describe the first image row by row, from top to bottom. Each of these lines is composed of $W$ characters describing the row's $W$ pixels, from left to right: the $k$-th character of the line is '.' if the $k$-th pixel of the row is white, and it is '#' if that pixel is black. Finally come $H$ lines that describe the second image row by row, following the same format as above.

## 출력

If no morphing exists, the output should contain the word "IMPOSSIBLE" on a single line.  Otherwise, the output should describe one possible morphing as follows: if the $(k+1)$-th image is obtained from the $k$-th image by flipping the pixel in column $c$ and row $r$ (with $0 \le c < W$ and $0 \le r < H$, where $c = 0$ represents the leftmost column and $r = 0$ represents the topmost row), the $k$-th output line contains the pair $(c,r)$.

## 제한

• $1 \le H \le 64$
• $1 \le W \le 103$
• Émile's first and last images are distinct from each other.
• The output should contain at most $250\,000$ pixel flips.

## 예제 입력 1

4 3
....
.#..
....
....
..#.
....


## 예제 출력 1

2 1
1 1


## 예제 입력 2

9 12
.........
...###...
...#.#...
.#######.
...###...
...###...
.#..#....
.#######.
...###.#.
...###...
..##.##..
.........
.........
..#####..
..##.##..
..#...#..
..#.#.#..
..#...#..
..#####..
...#.#...
...#.#...
...#.#...
.###.###.
.........


## 예제 출력 2

IMPOSSIBLE


## 출처

• 문제를 만든 사람: Mehdi Bouaziz