Your are given n sets.Every set contains some integers.
We say a set can express an integer, only when there exists a subset of the set such that the bitwise-xor of the elements in the subset is equal to that integer.
Now you need to answer m queries. Each query will give you three integers l,r,x and you should answer if for every

,the i-th set can express x.
输入描述:
The first line contains two integers n,m.
For each of the following n lines, the first integer sz stands for the size of this set and the following sz integers stand for the elements in this set. The sets are described from number 1 to n.
For each of the following m lines, there're three integers l,r,x that means a query.
输出描述:
For each query, output a line.
If for every
,the i-th set can express x, you need to print “YES”, and "NO" otherwise.
示例1
输入
复制
1 3
2 1 2
1 1 0
1 1 3
1 1 4
备注:
,
,
,the every integer in input
。