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 **A _{i}**>=0 for 1<=

**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**<=10^{5}

0<=**S,X**<=10^{9}

**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

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.

PM_Pranay | 38 |

m_raju | 22 |

Piyush_43 | 22 |

abducodes | 22 |

RamduttSharma | 18 |

Pulkit__Sharma__ | 626 |

Anirban166 | 503 |

abducodes | 468 |

Found_me | 430 |

Yo_Nehru | 404 |

blackshadows | 5331 |

Ibrahim Nash | 5219 |

akhayrutdinov | 5111 |

mb1973 | 4929 |

Quandray | 4559 |

Login to report an issue on this page.