#include<bits/stdc++.h>
using namespace std;
#define ll long long
const int mod = 1e9 + 7;
ll n, k;
struct MUL
{
ll m[105][105];
}res;
MUL mul(MUL a, MUL b)
{
MUL tmp;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
tmp.m[i][j] = 0;
}
}
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
for (int k = 1; k <= n; k++)
{
tmp.m[i][j] = (tmp.m[i][j] % mod + (a.m[i][k] % mod * b.m[k][j] % mod) % mod) % mod;
}
}
}
return tmp;
}
MUL quickpow(MUL a, ll b, ll modd)
{
if (b == 1)return a;
else
{
if (b % 2 == 0)
{
return quickpow(mul(a, a), b / 2, modd);
}
else
{
return mul(quickpow(mul(a, a), b / 2, modd), a);
}
}
}
int main()
{
MUL A;
cin >> n >> k;
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cin >> A.m[i][j];
}
}
MUL result = quickpow(A, k, mod);
for (int i = 1; i <= n; i++)
{
for (int j = 1; j <= n; j++)
{
cout << result.m[i][j] << " ";
}
cout << endl;
}
}