Matrix Power Series

Given a n × n matrix A and a positive integer k, find the sum S = A + A² + A³ + … + A^k.

The input contains exactly one test case. The first line of input contains three positive integers n (n ≤ 30), k (k ≤ 10⁹) and m (m < 10⁴). Then follow n lines each containing n nonnegative integers below 32,768, giving A’s elements in row-major order.

Output the elements of S modulo m in the same way as A is given.

2 2 4
0 1
1 1

1 2
2 3