空间限制：C/C++/Rust/Pascal 256 M，其他语言512 M
64bit IO Format: %lld
题目描述
Steve has an integer array a of length n (1-based). He assigned all the elements as zero at the beginning. After that, he made m operations, each of which is to update an interval of a with some value. You need to figure out 
after all his operations are finished, where 
means the bitwise exclusive-OR operator.
In order to avoid huge input data, these operations are encrypted through some particular approach.
There are three unsigned 32-bit integers X, Y and Z which have initial values given by the input. A random number generator function is described as following, where 
means the bitwise exclusive-OR operator, < < means the bitwise left shift operator and > > means the bitwise right shift operator. Note that function would change the values of X, Y and Z after calling.
Let the i-th result value of calling the above function as fi(i = 1, 2, ..., 3m). The i-th operation of Steve is to update aj as vi if aj < vi(j = li, li + 1, ..., ri), where
输入描述:
The first line contains one integer T, indicating the number of test cases.
Each of the following T lines describes a test case and contains five space-separated integers n, m, X, Y and Z.
1 ≤ T ≤ 100, 1 ≤ n ≤ 105, 1 ≤ m ≤ 5·106, 0 ≤ X, Y, Z < 230.
It is guaranteed that the sum of n in all the test cases does not exceed 106 and the sum of m in all the test cases does not exceed 5·107.
输出描述:
For each test case, output the answer in one line.
备注:
In the first sample, a = [1031463378] after all the operations.
In the second sample, a = [1036205629, 1064909195, 1044643689, 1062944339, 1062944339, 1062944339, 1062944339, 1057472915, 1057472915, 1030626924] after all the operations.