CF2008A Sakurako's Exam

Today, Sakurako has a math exam. The teacher gave the array, consisting of $ a $ ones and $ b $ twos. In an array, Sakurako must place either a '+' or a '-' in front of each element so that the sum of all elements in the array equals $ 0 $ . Sakurako is not sure if it is possible to solve this problem, so determine whether there is a way to assign signs such that the sum of all elements in the array equals $ 0 $ .

The first line contains a single integer $ t $ ( $ 1\le t\le 100 $ ) — the number of test cases. The only line of each test case contains two integers $ a $ and $ b $ ( $ 0\le a,b

For each test case, output "Yes" if you can make the sum of the entire array equal to $ 0 $ , and "No" otherwise. You can output each letter in any case (lowercase or uppercase). For example, the strings "yEs", "yes", "Yes", and "YES" will be accepted as a positive answer.

1. $ a=0 $ , $ b=1 $ : This means the array is $ [2] $ — it is impossible to add the signs '+' or '-' to get $ 0 $ as a result; 2. $ a=0 $ , $ b=3 $ : This means the array is $ [2, 2, 2] $ — it is impossible to add the signs '+' or '-' to get $ 0 $ as a result; 3. $ a=2 $ , $ b=0 $ : This means the array is $ [1, 1] $ — it is possible to add the signs '+' or '-' to get $ 0 $ as a result ( $ +1-1=0 $ ); 4. $ a=2 $ , $ b=3 $ : This means the array is $ [1, 1, 2, 2, 2] $ — it is possible to add the signs '+' or '-' to get $ 0 $ as a result ( $ +1+1-2-2+2=0 $ );