Ross is remembering his college days and how he designed an algorithm to join a friend circle -
There were N people in his class and each had a favourite number. Ross collected all their favourite numbers in the array A.
Any set of people formed a suitable friend circle if the bitwise xor of all the favourite numbers in a group was strictly greater than a given Ross Rating (a positive integer) R given by ross for that group of people.
But there was a catch. The favourite numbers kept changing but Ross had his sources which kept him updated.
Ross gives you q queries of two types-
For every query of the type 'c', you have to find if the people in the given group form a friend circle or not.
NOTE - Indexing starts from 1
Input format -
Output format -.
Constraints -
- For the first query, 2⊕6=4 hence the output is NO
- In the second query 2 is changed to 3
- In the third query, 3⊕6=5 hence, the answer is YES