시간 제한 | 메모리 제한 | 제출 | 정답 | 맞힌 사람 | 정답 비율 |
---|---|---|---|---|---|
3 초 (추가 시간 없음) | 1024 MB | 19 | 17 | 14 | 87.500% |
Joon-Pyo decorated a flowerbed in front of his home. The flowerbed is in the shape of an $n \times m$ grid, and one flower is planted in each cell. There are 26 colors, one corresponding to each uppercase letter from A to Z. Suddenly, he wanted to redecorate the flowerbed.
The flowerbed is too large to adjust the flowers one by one. He rented some equipment that can lift and rotate a square plot of land with a side length of $d$. He planned the construction in the following order, expecting the flowerbed to be properly redecorated.
Note that the equipment will never go out of the flowerbed, as $x$, $y$, and $d$ are carefully determined before construction begins.
He cannot start construction without knowing the outcome. Write a program that outputs the result.
On the first line, five integers $n$, $m$, $y$, $x$, and $d$ are given. ($1 \leq n \times m \leq 10^6 $, $ 1 \leq y \leq n$, $ 1 \leq x \leq m $, $ 1 \leq d \leq \min(n, m)$, $\boldsymbol{n \equiv d \pmod y}$, $\boldsymbol{m \equiv d \pmod x}$).
Each of the next $n$ lines contains exactly $m$ uppercase letters, the current flowerbed.
Output $n$ lines, each containing $m$ uppercase letters, the flowerbed after the planned construction.
4 4 1 1 2 AAAA BBBB AAAA BBBB
BAAA ABBB BAAA BBBA
6 5 1 2 3 RBRCY YBPBR PBRCY CYPBR PBRCY CYPBR
PYRBR CRCBB PPBPY CRCYB YRBCY PYRBR
In the first example, the flowerbed changes as follows:
University > KAIST > 2021 KAIST 11th ICPC Mock Competition D번