#include <bits/stdc++.h> #define MAXN 100005 #define oo 1e9 #define ll long long using namespace std; const ll mod = 1e9 + 7; struct Matrix { ll v[150][150]; int row, col; }; Matrix multiply(Matrix A, Matrix B) { Matrix r; r.row = A.row; r.col = B.col; for (int i = 0; i < r.row; i++) { for (int j = 0; j < r.col; j++) { r.v[i][j] = 0; for (int k = 0; k < A.col; k++) { r.v[i][j] += (A.v[i][k] % mod * B.v[k][j] % mod); r.v[i][j] %= mod; } } } return r; } Matrix power(Matrix A, ll p) { if (p == 1) return A; if (p % 2 == 1) return multiply(A, power(A, p - 1)); Matrix r = power(A, p / 2); r = multiply(r, r); return r; } int main() { // RF; ios::sync_with_stdio(0); cin.tie(0); ll m, n; cin >> m >> n; Matrix M; M.row = m; M.col = m; for (int i = 0; i < m; i++) { for (int j = 0; j < m; j++) cin >> M.v[i][j]; } M = power(M, n); for (int i = 0; i < m; i++) { for (int j = 0; j < m; j++) cout << M.v[i][j] % mod << " "; cout << endl; } return 0; }