PROGRAMMING:Chessboard coverage
In a chessboard composed of 2 ^ k * 2 ^ k squares (k is a positive integer, K < = 10, length = 2 ^ k), there is just one square which is different from other squares. This square is called a special square (its coordinates are AA and BB, representing row coordinate number and column coordinate number respectively), and there are four kinds of L-shaped dominoes (as shown in the figure below). In addition to the special point, the chessboard can be completely covered by several L-shaped dominoes（ This problem requires using divide and conquer algorithm
###Input format:
Enter three numbers: AA, BB and length
###Output format:
Output the whole chessboard. The special square is filled with 0, and then the order of laying the chessboard is: first lay the junction part of the four sub chessboards, and then recursively lay the chessboard on each sub chessboard in the clockwise order of top left, top right, bottom right and bottom left. The number of three squares in each dominoes is the same, and they are labeled in order, that is, the first dominoes are all marked with 1, the second dominoes are all marked with 2,..., and so on. Each output number takes up 4 field widths and is right aligned.
###Input example:
```in
1 1 4
```
The special grid is (1,1), and the chessboard has 4 rows and 4 columns.
###Output example:
```out
0 2 3 3
2 2 1 3
5 1 1 4
5 5 4 4
```
It means: first lay three 1s (one L-shaped dominoes), then lay three 2S,..., and finally lay three 5S
answer：If there is no answer, please comment
###Input format:
Enter three numbers: AA, BB and length
###Output format:
Output the whole chessboard. The special square is filled with 0, and then the order of laying the chessboard is: first lay the junction part of the four sub chessboards, and then recursively lay the chessboard on each sub chessboard in the clockwise order of top left, top right, bottom right and bottom left. The number of three squares in each dominoes is the same, and they are labeled in order, that is, the first dominoes are all marked with 1, the second dominoes are all marked with 2,..., and so on. Each output number takes up 4 field widths and is right aligned.
###Input example:
```in
1 1 4
```
The special grid is (1,1), and the chessboard has 4 rows and 4 columns.
###Output example:
```out
0 2 3 3
2 2 1 3
5 1 1 4
5 5 4 4
```
It means: first lay three 1s (one L-shaped dominoes), then lay three 2S,..., and finally lay three 5S
answer：If there is no answer, please comment