- Time limit: 1.00 s
- Memory limit: 512 MB
Your task is to fill an grid using L-trominos (three squares that have an L-shape). For example, here is one way to fill a grid:
Input
The first input line has an integer : the number of tests.
After that, there are lines that describe the tests. Each line has two integers and .
Output
For each test, print YES if there is a solution, and NO otherwise.
If there is a solution, also print lines that each contain letters between A–Z. Adjacent squares must have the same letter exactly when they belong to the same tromino. You can print any valid solution.
Constraints
Example
Input:
2 4 6 4 7
Output:
YES AADDBB ACCDEB BCAEEC BBAACC NO