RT

#include<bits/stdc++.h>
using namespace std;
constexpr long long mod = 1e9 + 7;

int n;
long long k;

struct node{
	long long a[109][109];
	
	node (){
		memset(a,0,sizeof(a));
	}
		
	inline void build(){
		for(int i = 1;i<=n;i++) a[i][i] = 1;
	}
		
	node operator * (const node b){
		node c;
	 	for(int k=1;k<=n;k++)
			for(int i=1;i<=n;i++)
				for(int j=1;j<=n;j++)
					c.a[i][j]=(c.a[i][j]+a[i][k]*b.a[k][j]%mod)%mod;
		return c;
	}
}a,ans,base;

int main()
{
	cin >> n >> k;
	
	for(int i = 1;i<=n;i++)
		for(int j = 1;j<=n;j++)
			cin >> a.a[i][j];
	
	ans.build();
	
	
	base = a;
	
	while(k > 0)
    {
		if(k & 1)
        {
			ans = ans * base;
    	}
		
        base = base * base;
		k >>= 1;
	}
	
	for(int i = 1;i<=n;i++){
		for(int j = 1;j<=n;j++)
			cout << a.a[i][j] << " ";
		cout << "\n";
	}
		
}