Cyrus has come across a curious sight — an undirected, weighted graph with (NM) nodes (numbered from (0) to ( NM - 1)) and (NM + N) edges (numbered from (0) to (NM + N - 1)). Each edge initially has a weight of (1).

What makes this graph so curious is its shape. The nodes are arranged in (N) "circles" of (M) nodes each. Nodes (0..(M - 1)) are in the first circle, nodes (M..(2*M - 1)) are in the second, and so on. In each circle, the nodes are arranged in clockwise order (ordered by increasing node number).

The first (NM) edges lie within circles, with (M) edges per circle. Edges (0..(M - 1)) lie within the first circle, edges (M..(2M - 1)) lie within the second, and so on. In each circle, its first (lowest-numbered) edge connects the circle's first and second nodes, its second edge connects its second and third nodes, and so on, with its final edge connecting its final and first nodes.

There are (N) more edges (edges ((NM)..(NM + N - 1))) connecting the (N) circles into what might be considered an additional circle. Each circle (i) has two "connection points", the first of which is its ((X_i+1))st node (that is, node (Mi + X_i)), and the second of which is its ((Y_i+1))st node (node (Mi + Y_i)). (X_i) and (Y_i) are not necessarily distinct. The (i)th of the (N) final edges connects the second connection point of circle (i) and the first connection point of circle (((i+1)\text{ modulo }N)). That is, there's an edge between nodes (M0 + Y_0) and (M1 + X_1), another between (M1 + Y_1) and (M2 + X_2), and so on, with the final edge connecting nodes (M*(N-1) + Y_{N-1}) and (M*0 + X_0).

For example, if (N = 3), (M = 3), (X = [0, 2, 1]), and (Y = [1, 2, 0]), the graph would look as follows (with the first (N*M) edges indicated in blue, and the last (N) in red):

Cyrus was hoping to practice computing the minimum spanning tree of this graph, but it's starting to change before his very eyes! (E) events are about to occur on the graph (numbered from (0) to (E-1)), one after another. Event (i) will cause the weight of edge (I_i) to become (W_i). When an edge's weight changes, it will remain at its new value for future events (until changed again).

Let (V_i) be the weight of the graph's minimum spanning tree after the first (i) events. Help Cyrus compute the product of (V_{1..E}). As this product may be very large, you should only compute its value modulo 1,000,000,007.

In order to reduce the size of the input, the above values will not all be provided explicitly. Instead, you'll be given the first (K) values (X_{0..(K-1)}), (Y_{0..(K-1)}), (I_{0..(K-1)}), and (W_{0..(K-1)}), as well as the four triples of constants ((A_X, B_X, C_X)), ((A_Y, B_Y, C_Y)), ((A_I, B_I, C_I)), and ((A_W, B_W, C_W)), and must then compute (X_{K..(N-1)}), (Y_{K..(N-1)}), (I_{K..(E-1)}), and (W_{K..(E-1)}) as follows:

(X_i = (A_X * X_{i-2} + B_X * X_{i-1} + C_X)\text{ modulo }M) for (i \ge K) (Y_i = (A_Y * Y_{i-2} + B_Y * Y_{i-1} + C_Y)\text{ modulo }M) for (i \ge K) (I_i = (A_I * I_{i-2} + B_I * I_{i-1} + C_I)\text{ modulo }(N*M + N)) for (i \ge K) (W_i = (A_W * W_{i-2} + B_W * W_{i-1} + C_W)\text{ modulo }1,000,000,000) for (i \ge K)

Input

Input begins with an integer (T), the number of graphs. For each graph, there are 9 lines:

The first line contains the 4 space-separated integers (N), (M), (E), and (K).

The second line contains the (K) space-separated integers (X_{0..K-1}).

The third line contains the 3 space-separated integers (A_X), (B_X), and (C_X).

The fourth line contains the (K) space-separated integers (Y_{0..K-1}).

The fifth line contains the 3 space-separated integers (A_Y), (B_Y), and (C_Y).

The sixth line contains the (K) space-separated integers (I_{0..K-1}).

The seventh line contains the 3 space-separated integers (A_I), (B_I), and (C_I).

The eighth line contains the (K) space-separated integers (W_{0..K-1}).

The ninth line contains the 3 space-separated integers (A_W), (B_W), and (C_W).

Output

For the (i)th graph, print a line containing "Case #i: " followed by a single integer, the product of (V_{1..E}) modulo 1,000,000,007.

Constraints

(1 \le T \le 90) (3 \le N, M \le 1,000,000) (NM + N \le 1,000,000) (2 \le E \le 1,000,000) (2 \le K \le min(N, E)) (0 \le A_X, B_X, C_X, A_Y, B_Y, C_Y, A_I, B_I, C_I, A_W, B_W, C_W \le 1,000,000,000) (0 \le X_i, Y_i < M) (0 \le I_i < NM + N) (0 \le W_i < 1,000,000,000)

The sum of (N*M + E) across all (T) graphs is at most 20,000,000.

Explanation of Sample

For the first graph:

(X = [0, 2, 1])
(Y = [1, 2, 0])
(I = [9, 10, 11])
(W = [1, 1, 1])

Each event causes an edge weight to remain equal to (1). Therefore, the graph looks as follows, both initially and after all three events:

A minimum spanning tree on this graph must involve 8 weight-1 edges. Therefore, (V = [8, 8, 8]), and the final answer is ((8 * 8 * 8)\text{ modulo 1,000,000,007} = 512).

For the second graph:

(X = [0, 2, 1])
(Y = [1, 2, 0])
(I = [6, 10, 2, 5, 3, 2, 10, 1])
(W = [0, 2, 2, 3, 3, 4, 4, 5])

After the eighth and final event, the graph looks as follows, with one possible minimum spanning tree highlighted:

For this graph, (V = [7, 7, 7, 7, 9, 9, 9, 12]).

For the third graph:

(X = [1, 2, 0])
(Y = [1, 1, 0])
(I = [14, 12, 1, 3, 5, 7, 9, 11, 13, 0])
(W = [11, 0, 6, 9, 12, 15, 18, 21, 24, 27])

For this graph, (V = [11, 10, 10, 15, 15, 25, 25, 42, 53, 61]).

For the fourth graph:

(X = [4, 1, 3, 4, 0])
(Y = [0, 3, 3, 0, 0])