Ravi and Sam's Meeting

Ravi and Sam are trying to meet on a grid. The grid is defined by two positive integers \(n\) and \(m\), which represent its dimensions. They can meet if and only if \(n\) and \(m\) have the same parity (i.e. either both even or both odd). In other words, they can meet if \(n \mod 2 = m \mod 2\); otherwise, they cannot.

Your task is to determine, for a given set of grid dimensions, whether Ravi and Sam can meet.

inputFormat

The first line of input contains a single integer \(T\) (number of test cases). Each of the following \(T\) lines contains two space-separated integers \(n\) and \(m\) representing the grid dimensions.

outputFormat

For each test case, output a single line containing either "YES" if Ravi and Sam can meet, or "NO" if they cannot.

3
2 2
3 3
2 3

YES
YES
NO