Mr. Fox sure loves his socks! He stores his many indistinguishable socks in a set of N bins, which are arranged in a circle and numbered in clockwise order. For every 1 ≤ i < N, the next bin clockwise of bin i is bin i+1, and the next bin clockwise of bin N is bin 1. Initially, the ith bin contains S_i socks.

Never being quite satisfied with his sock collection, Mr. Fox would like to perform M operations on it, one after another. Each operation i may be of one of the following 4 types, determined by the value of O_i:

1. Given integers A_i, B_i, C_i, and D_i, add C_i + 0*D_i socks to bin A_i, add C_i + 1*D_i socks to the next bin clockwise of bin A_i, add C_i + 2*D_i to the next bin clockwise of that one, and so on until this has been done for B_i bins. Determine the total number of socks added in this process.

2. Given integers A_i, B_i, and C_i, remove all of the socks from bin A_i and then add C_i socks to it. Do the same for the next bin clockwise of A_i, and so on until this has been done for B_i bins. Determine the sum of two values: the total number of socks removed in this process, and the total number of socks added in this process.

3. Given integers A_i and B_i, count the number of socks in bin A_i (without removing them), the number of socks in the next bin clockwise of A_i, and so on until the socks in B_i bins have been counted. Determine the total number of socks counted in this process.

4. Given integers A_i and B_i, check if bin A_i contains an odd number of socks. Do the same for the next bin clockwise of A_i, and so on until this has been done for B_i bins. Determine the total number of these bins that contain an odd number of socks.

Can you help Mr. Fox keep track of his socks? Note the value calculated during each of the M operations as they're performed, and then output the sum of all M of the values modulo 10⁹.

Input

Input begins with an integer T, the number of sock collections Mr. Fox has. For each sock collection, there are 7 lines containing the following space-separated integers:

1. N M
2. S₁ S₂ X_S Y_S Z_S
3. O₁ O₂ X_O Y_O Z_O
4. A₁ A₂ X_A Y_A Z_A
5. B₁ B₂ X_B Y_B Z_B
6. C₁ C₂ X_C Y_C Z_C
7. D₁ D₂ X_D Y_D Z_D

The first two elements of each sequence of integers (S, O, A, B, C, and D) are given, and the rest are computed with the following pseudorandom generators:

• S_i = (X_S*S_i-2 + Y_S*S_i-1 + Z_S) modulo 10⁹, for 3 ≤ i ≤ N
• O_i = ((X_O*O_i-2 + Y_O*O_i-1 + Z_O) modulo 4) + 1, for 3 ≤ i ≤ M
• A_i = ((X_A*A_i-2 + Y_A*A_i-1 + Z_A) modulo N) + 1, for 3 ≤ i ≤ M
• B_i = ((X_B*B_i-2 + Y_B*B_i-1 + Z_B) modulo N) + 1, for 3 ≤ i ≤ M
• C_i = (X_C*C_i-2 + Y_C*C_i-1 + Z_C) modulo 10⁹, for 3 ≤ i ≤ M
• D_i = (X_D*D_i-2 + Y_D*D_i-1 + Z_D) modulo 10⁹, for 3 ≤ i ≤ M

Output

For the ith sock collection, print a line containing "Case #i: " followed by the sum of all values calculated during each operation, modulo 10⁹.

Constraints

1 ≤ T ≤ 20
2 ≤ N ≤ 1,000,000
2 ≤ M ≤ 1,000,000
0 ≤ S_i < 10⁹
1 ≤ O_i ≤ 4
1 ≤ A_i ≤ N
1 ≤ B_i ≤ N
0 ≤ C_i < 10⁹
0 ≤ D_i < 10⁹
0 ≤ X_S, X_O, X_A X_B, X_C, X_D < 10⁹
0 ≤ Y_S, Y_O, Y_A Y_B, Y_C, Y_D < 10⁹
0 ≤ Z_S, Z_O, Z_A Z_B, Z_C, Z_D < 10⁹

Explanation of Sample

The first collection has 5 bins that all have 0 socks. None of the operations involve any socks at all, so the answer is 0.

The second collection has 5 bins with 1, 2, 3, 4, and 5 socks. Mr. Fox performs the operations 1, 2, 3, and 4 in order. For each operation, A = 1, B = 5, C = 0, D = 0. He first adds 0 socks to the bins, then removes all 15 socks, then counts the 0 remaining socks, and then counts 0 odd bins, for a total of 15.

The third collection also has 5 bins with 1, 2, 3, 4, and 5 socks. Mr. Fox performs the same operations, but this time C and D take on the values 1, 2, 3, and 4 in that order. He adds 15 socks to the bins, then removes all 30 socks and adds 2 socks to each bin, then counts those 10 socks, and then counts 0 odd bins. The total is then 15 + 30 + 10 + 10 = 65.