- Time limit: 1.00 s
- Memory limit: 512 MB
The first input line has an integer $t$: the number of tests.
After that, there are $t$ lines that describe the tests. Each line has two integers $n$ and $m$.
For each test, print YES if there is a solution, and NO otherwise.
If there is a solution, also print $n$ lines that each contain $m$ 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.
- $1 \le t \le 100$
- $1 \le n,m \le 100$