B'Elena has a grid formed by n horizontal lines and m vertical lines. The horizontal lines are numbered by integers from 1 to n from top to bottom. The vertical lines are numbered by integers from 1 to m from left to right. For each x and y ( 1 <= q x <= q n , 1 <= q y <= q m ), the notation (x, y) denotes the point at the intersection of the x -th horizontal line and y -th vertical line. Two points (x_1,y_1) and (x_2,y_2) are adjacent if and only if |x_1-x_2| + |y_1-y_2| = 1 . Elena calls a sequence of points p_1, p_2, ldots, p_g of length g a walk if and only if all the following conditions hold: Note that the walk may contain the same point more than once. In particular, it may contain point (1, 1) or (n, m) multiple times. There are n(m-1)+(n-1)m segments connecting the adjacent points in Elena 's grid. Elena wants to color each of these segments in blue or red color so that there exists a walk p_1, p_2, ldots, p_{k+1} of length k+1 such that Please find any such coloring or report that there is no such coloring. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= q t <= q 32 ). The description of test cases follows. The only line of each test case contains three integers n , m , and k ( 3 <= q n,m <= q 16 , 1 <= q k <= q 10^9 ) -- the dimensions of the grid and the number of segments in the walk Elena is looking for. For each test case, output "NO" if it is not possible to color each of the n(m-1)+(n-1)m segments in blue or red color, so that there exists a walk of length k+1 satisfying the condition from the statement. Otherwise, output in the first line "YES", and then provide the required coloring. In each of the first n lines of coloring description, output m-1 space-separated characters. The j -th characte'...