Very Tough Problem
Submissions: 401   Accuracy:

38.4%

  Difficulty: Hard   Marks: 8

You are given three numbers N, S and X. You have to tell whether it is possible to construct such sequence A of length N, where each Ai>=0 for 1<=i<=N and the sum of all numbers in a sequence is equal to S, and the XOR of sequence equals to X.

INPUT
First line of input contains T denoting number of test cases.
First line of each test case contains three integers N, S and X, as described above.

OUTPUT
For each test case output a single line containing “Yes” (without quotes), if it is possible to have such a sequence and

No”, if it is not possible to have such a sequence.

CONSTRAINTS
1<=T<=5000
1<=N<=105
0<=S,X<=109

SAMPLE INPUT

3
1 3 2
2 10 0

SAMPLE OUTPUT

No
Yes

 

EXPLAINATION

In the second test case, we can use the sequence "5 5", because the XOR of all elements will be 0, and sum  10

 

 

** For More Input/Output Examples Use 'Expected Output' option **

Contributor: Tanuj Yadav
Author: tanujyadav97


If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.



Need help with your code? Please use ide.geeksforgeeks.org, generate link and share the link here.


to report an issue on this page.