Game of the life (2) P27283

This exercise is a continuation of the exercise ‍

Let M₀ be a matrix with bacteria at the initial time, and let M₁, M₂, M₃, …be the matrices at the times 1, 2, 3, …Write a program that, given M₀, finds the cycle that is obtained starting at M₀, 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₀: 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.