# Coming Soon

.

The only difference between this problem and D1 is that you don’t have to provide the way to construct the answer in D1, but you have to do it in this problem.

There’s a table of n×mn×m cells (nn rows and mm columns). The value of nmn⋅m is even.

A domino is a figure that consists of two cells having a common side. It may be horizontal (one of the cells is to the right of the other) or vertical (one of the cells is above the other).

You need to place nm2nm2 dominoes on the table so that exactly kk of them are horizontal and all the other dominoes are vertical. The dominoes cannot overlap and must fill the whole table.

Input

The first line contains one integer tt (1t101≤t≤10) — the number of test cases. Then tt test cases follow.

Each test case consists of a single line. The line contains three integers nnmmkk (1n,m1001≤n,m≤1000knm20≤k≤nm2nmn⋅m is even) — the count of rows, columns and horizontal dominoes, respectively.

Output

For each test case:

• print “NO” if it’s not possible to place the dominoes on the table in the described way;
• otherwise, print “YES” on a separate line, then print nn lines so that each of them contains mm lowercase letters of the Latin alphabet — the layout of the dominoes on the table. Each cell of the table must be marked by the letter so that for every two cells having a common side, they are marked by the same letters if and only if they are occupied by the same domino. I.e. both cells of the same domino must be marked with the same letter, but two dominoes that share a side must be marked with different letters. If there are multiple solutions, print any of them.

input Domino (hard version) solution codeforces

Copy Domino (hard version) solution codeforces
8
4 4 2
2 3 0
3 2 3
1 2 0
2 4 2
5 2 2
2 17 16
2 1 1


output

Copy
YES
accx
aegx
bega
bdda
YES
aha
aha
YES
zz
aa
zz
NO
YES
aaza
bbza
NO
YES
bbaabbaabbaabbaay
ddccddccddccddccy
NO


For Solution