XP and EG like playing Chinese chess. One day when they were playing Chinese chess. The scrupulous EG found that the horse can get everywhere of the chessboard. EG want to
know if the horse jump x and y(in stead of 2 and 1) int one step. Whether it can also get everywhere of the chessboard. We can ensure the chessborad is very large. So the hard work was left for XP; But XP is too lazy to finish it. Be the good friend of him. You may give him a hand.

The fist line with a positive integer t, stands for the test case; then following with t lines. Each lines two positive integers x,y(1<=x,y<=60000) stand for how the horse jump.

For each test. if the horse can get erverywhere of the chessborad print "Yes!" in one line, or print"No!".