Emptying Two Piles

Difficulty: 1300 3000 ms 128 MB

math

Two piles hold A and B coins. A move removes 1 coin from one pile and 2 from the other (your choice which). For each test case, can both piles be emptied exactly?

Input: the first line has T (number of cases); each of the next T lines has A and B.

Output: T lines of YES/NO.

Constraints:

• 1 ≤ T ≤ 10⁴
• 0 ≤ A, B ≤ 10⁹

Sample Tests

3
2 1
2 2
3 3

YES
NO
YES

1
0 0

YES

Read the Editorial