B'An n x m grid of characters is called great if it satisfies these three conditions: Let (x,y) denote the cell in the x -th row from the top and y -th column from the left. You want to construct a great grid that satisfies k constraints. Each constraint consists of two cells, (x_{i,1},y_{i,1}) and (x_{i,2},y_{i,2}) , that share exactly one corner. You want your great grid to have the same letter in cells (x_{i,1},y_{i,1}) and (x_{i,2},y_{i,2}) . Determine whether there exists a great grid satisfying all the constraints. Each test contains multiple test cases. The first line contains the number of test cases t ( 1 <= t <= 10^3 ). The description of the test cases follows. The first line of each test case contains three integers, n , m , and k ( 2 <= n,m <= 2 cdot 10^3 , 1 <= k <= 4 cdot 10^3 ). Each of the next k lines contains four integers, x_{i,1} , y_{i,1} , x_{i,2} , and y_{i,2} ( 1 <= x_{i,1} < x_{i,2} <= n , 1 <= y_{i,1},y_{i,2} <= m ). It is guaranteed that either (x_{i,2},y_{i,2}) = (x_{i,1}+1,y_{i,1}+1) or (x_{i,2},y_{i,2}) = (x_{i,1}+1,y_{i,1}-1) . The pairs of cells are pairwise distinct, i.e. for all 1 <= i < j <= k , it is not true that x_{i,1} = x_{j,1} , y_{i,1} = y_{j,1} , x_{i,2} = x_{j,2} , and y_{i,2} = y_{j,2} . It is guaranteed that the sum of n over all test cases does not exceed 2 cdot 10^3 . It is guaranteed that the sum of m over all test cases does not exceed 2 cdot 10^3 . It is guaranteed that the sum of k over all test cases does not exceed 4 cdot 10^3 . For each test case, output "YES" if a great grid satisfying all the constraints exists and "NO" otherwise. You can output the answer in any case (upper or lower). For example, the strings "yEs", "yes", "Yes", and "YES" will be recognized as positive responses. In the fi'...