- Time limit: 1.00 s
- Memory limit: 512 MB
Your task is to efficiently find out if you can empty both the piles.
The first input line has an integer $t$: the number of tests.
After this, there are $t$ lines, each of which has two integers $a$ and $b$: the numbers of coins in the piles.
For each test, print "YES" if you can empty the piles and "NO" otherwise.
- $1 \le t \le 10^5$
- $0 \le a, b \le 10^9$