Chess Positions

You have an unlimited number of white and black chess pieces such as the queen, bishop, knight and rook. You are also given two numbers, $w$ and $b$, the number of white and black pieces that must be under attack. It is required to create a position on the board 8$\times$8 suitable for the restrictions described above.

The queen, the bishop and the rook move in the allowed direction before another figure is met and can attack if it is of a different color. The Knight also attacks a figure of a different color and and can jump over other pieces.

First line contains integer $t$ --- number of tests. Next $t$ lines contain two integers $w$ and $b$ each --- number of white and black chess pieces under attack, correspondingly.

For each test, you are required to output a chess position which satisfies given conditions. The position should be represented by 8 lines containing 8 symbols each. The positions should be split by an empty line. Empty cells should be printed as '.', cells containing queen should be represented as 'q', bishop cells -- 'b', knight cells -- 'k', and rook cells -- 'r'. White pieces should be printed in upper case and black ones in lower case. If there are multiple correct positions, you may print any of them. It is guaranteed that the correct answer always exists.

• $1 \le t \le 10^3$
• $0 \le w, b \le 50$
• $w + b \le 64$