7567: Bitwise Xor

内存限制:512 MB 时间限制:5 S 标准输入输出
题目类型:传统 评测方式:文本比较 上传者:
提交:0 通过:0

题目描述

Notice:Don't output extra spaces at the end of one line.

Koishi loves bitwise xor!

Satori knows that, so she decides to play a game with Koishi and her n pets. There are n pets standing in a row, and the i-th of them has mi kinds of magic, the j-th magic can be described as a pair of non-negative integers(xij,yij). If she use this magic to a non-negative integer w, then she can turn w into w⊕xij or w⊕yij as she wants. addtionally, the i-th pet has her favorate integer pi.

Satori's game consists of q rounds. In each round, one of following two things may happan:

1. Koishi closes her third eye, so Satori select one of her pets, and change its favorate integer.

2. Koishi's third eye reopens, so Satori tells three non-negative integers l,r,x(1≤l≤r≤n). Then, pets with index from l to r will use the magic to the integer x one by one(l-th is the first and r-th is the last), every pet \textbf{must} use \textbf{each} of her magic \textbf{exactly once}. After r-th pet finishes her operation, integer x will become y at last. Every pet want the final y to be her own favorate integer p. so the i-th pet will try her best to make y⊕pi as small as possible(notice y is the final integer) . Every pet konws any other pets' magic details, favorate integer, and l,r,x in the current round. Suppose they are all the cleverest, what's the final integer y?

Koishi is NO.1 all over the world, so she computes the final y easily.

What about you?

输入格式

The first line contains one positive integer T(1≤T≤15), representing T test cases.

In each test case, the first line contains two positive integer n,q(1≤n,q≤105), number of pets and rounds.

Following is information of pets. For i-th pet, the first line contains two positive integers mi,pi, the number of magic the i-th pet owns and her initial favorate integer. Following are mi lines. j-th of them contains two non-negative integers xij,yij.(1≤∑mi≤105,0≤p,x,y,w<230)

Following q(1≤q≤105) lines is information of each round. The i-th line has two possibilities.

1 x y :means px is changed to y(0≤y<230)

2 l r x: means a game with parameters l,r,x(1≤l≤r≤n,0≤y<230) begins.

输出格式

For each game, output a line with a non-negative integer representing the final y at last of this game.

输入样例 复制

1
5 6
2 11
51 25
33 10
2 26
17 52
10 44
2 30
13 52
46 51
2 16
31 34
44 35
2 34
27 4
47 61
1 4 9
2 1 4 33
1 1 47
2 1 1 47
1 3 41
2 1 3 26

输出样例 复制

30
61
46