시간 제한메모리 제한제출정답맞힌 사람정답 비율
3 초 512 MB44211946.341%

문제

For crater exploration purposes, the Arecibo telescope records images of Saturn’s satellites. The scientific team must distinguish between satellite images and group the images by satellite, but it’s not that simple because satellites could be shot from different angles.

Captured images can be displayed as n × m matrices, filled with '*' (crater) and '.' (plain surface). We say that two images correspond to the same satellite if one can get the other by circular shifts of rows and columns.

To make the verification process easier, scientists want to find the lexicographically smallest image corresponding to the satellite from the given image. When comparing images, we compare strings obtained by concatenating all rows of the image, where characters are compared by ASCII value.

입력

The first line contains integers n and m (1 ≤ n, m ≤ 1000), the dimensions of the image.

Each of the following n lines contains m characters '*' and '.'. This represents the captured image.

출력

Output n lines with m characters each, the wanted lexicographically smallest image.

서브태스크

번호배점제한
110

1 ≤ n, m ≤ 50

240

1 ≤ n, m ≤ 300

360

No additional constraints.

예제 입력 1

3 3
.**
*..
.*.

예제 출력 1

**.
..*
*..

예제 입력 2

3 4
....
..*.
....

예제 출력 2

*...
....
....

예제 입력 3

3 5
.**..
.***.
..**.

예제 출력 3

***..
.**..
**...

힌트

Clarification of the first example:

All images that can be obtained by circular shifts are:

.** .*. *.. **. *.. ..* *.* ..* .*.
*.. .** .*. ..* **. *.. .*. *.* ..*
.*. *.. .** *.. ..* **. ..* .*. *.*

채점 및 기타 정보

  • 예제는 채점하지 않는다.