**Compilation/Execution Result:**

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

dauntless | 84 |

rksingh | 74 |

iharshitmittal | 74 |

sj5331 | 69 |

madhumitha d rao | 66 |

Shashank_Pathak | 636 |

dark_knights | 560 |

surbhi_7 | 556 |

SANJAY5797 | 359 |

rksingh | 358 |

akhayrutdinov | 4159 |

sanjay05 | 3611 |

Quandray | 2829 |

Ibrahim Nash | 2501 |

Michael Riegger | 2296 |