Meeting in the Grid

Alice and Bob are placed in a grid with N rows and M columns. They can meet if and only if the parity of the number of rows and columns is the same. In mathematical terms, they can meet if \(N \bmod 2 = M \bmod 2\); otherwise, they cannot.

Your task is to determine, for each test case, whether Alice and Bob can meet in the grid. Print "Yes" if they can meet, or "No" otherwise.

inputFormat

The first line of input contains a single integer T (\(1 \le T \le 10^4\)), the number of test cases. Each of the following T lines contains two integers N and M (\(1 \le N, M \le 10^9\)) representing the number of rows and columns in the grid respectively.

outputFormat

For each test case, output a single line containing "Yes" if Alice and Bob can meet, or "No" otherwise.

2
2 2
3 3

Yes
Yes