Stick break

Sam has a stick of length N.

He can break the stick into 2 or more parts such that the parity of length of each part is same. For example, a stick of length 11 can be broken into three sticks of lengths {3,3,5} since each part is odd, but it cannot be broken into two sticks of lengths {5,6} since one is even and the other is odd.

Sam can then continue applying this operation on the smaller sticks he obtains, as many times as he likes.

Can Sam obtain a stick of length exactly X by doing this?
        
       Input:-3
6 1
3 2
4 3
       Input Description: The first line of input will contain a single integer T, denoting The number of test cases. The description of The test cases follows.
-each test case consists of a single line of input, containing two space-separated integers N,X. 
       Output: YES
NO
YES
       Output Description: For each test case, output on a new line YES if Sam can obtain a stick of length exactly X, and NO otherwise.

Each letter of the output may be printed in either lowercase or uppercase. For example, the strings YES, yEs, and Yes will be considered identical. 
       Constraints: 1<=T<=1000
1<=X<N<=10^9
       Explanation: Test case 1: Sam can initially break the stick into 3 parts of length 2 each. After that, Chef can pick any segment of length 2 and break it into 2 sticks of length 1 each.

Test case 2: Sam cannot obtain a stick of length 2, since the only way to break a stick of length 3 following the given conditions is into three parts of length 1 each.

Test case 3: Sam can break the stick into lengths 3 and 1.