This exercise is a continuation of the exercise

Let M_{0} be a matrix with bacteria at the initial time,
and let M_{1}, M_{2}, M_{3}, …be the matrices at the times 1, 2, 3, …Write a program that, given M_{0},
finds the cycle that is obtained starting at M_{0},
that is, the first and shortest sequence of matrices
M_{i}, M_{i+1}, …, M_{j−1}, M_{j} such that M_{j+1} = M_{i}.
Suppose j < 100.

Input

Input consists of the description of the matrix M_{0}:
two strictly positive natural numbers n and m,
followed by n lines, each one with m characters:
‘B’ if the position has a bacterium, and ‘.’ if the position is empty.

Output

Print the matrices of the cycle M_{i}, M_{i+1}, …, M_{j−1}, M_{j}
separated by an empty line.

Public test cases

**Input**

7 7 ....BBB .B.BBBB .B.BBBB ..BBBBB .B.BBBB .B.BBBB ....BBB

**Output**

....... ....... ....... BBB.... ....... ....... ....... ....... ....... .B..... .B..... .B..... ....... .......

**Input**

2 2 BB ..

**Output**

.. ..

**Input**

10 10 .......... ...BBBB... ...B..B... .BBB..BBB. .B......B. .B......B. .BBB..BBB. ...B..B... ...BBBB... ..........

**Output**

.......... ...BBBB... ...B..B... .BBB..BBB. .B......B. .B......B. .BBB..BBB. ...B..B... ...BBBB... .......... ....BB.... ...BBBB... .......... .B.B..B.B. BB......BB BB......BB .B.B..B.B. .......... ...BBBB... ....BB.... ...B..B... ...B..B... ..BB..BB.. BBB....BBB .......... .......... BBB....BBB ..BB..BB.. ...B..B... ...B..B...

Information

- Author
- Salvador Roura
- Language
- English
- Translator
- Carlos Molina
- Original language
- Catalan
- Other languages
- Catalan
- Official solutions
- C++ Java Python
- User solutions
- C++ Python