Description

Given two integral m × n matrices A = {a_ij} and B = {b_ij}, we define a sequence of matrices S_B = {B^k} with B¹ = B where, for each k > 1,

.

Write a program that is capable of evaluating S_B efficiently.

Input

The input consists of a single test case and is given in the following format:

Bounds on the values are: 1 ≤ m, n ≤ 20; 1 ≤ t ≤ 1000; 0 ≤ a_ij, b_ij ≤ 10; 1 ≤ i_t ≤ m; 1 ≤ j_t ≤ n; 1 ≤ k_t ≤ 10⁹.

Output

For each t, output b_itjt^k_t mod 1,000,000,007.

2 2 5
1 2
2 1
1 1
1 1
1 1 2
1 2 2
2 1 2
2 2 2
1 1 3

1
2
2
9
1

Hint

1,000,000,007 is a prime.

Source

POJ Founder Monthly Contest – 2008.03.16, Gao Yihan