#include<bits/stdc++.h>
using namespace std;
unsigned long long n,k,mod,a[31][31],b[31][31],qh[31][31];
void juzhen(unsigned long long x){
	int c[31][31]={0};
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				c[i][j]+=b[i][k]*a[k][j]%mod;
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			b[i][j]=c[i][j]%mod;
		}
	}
}

int main(){
	freopen("matrix_sum.in","r",stdin);freopen("matrix_sum.out","w",stdout);
	cin>>n>>k>>mod;
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cin>>a[i][j];
			b[i][j]=a[i][j]%mod;
			qh[i][j]=a[i][j]%mod;
		}
	}
	for(int i=2;i<=k;i++){ 
		juzhen(i);
		for(int j=1;j<=n;j++){
			for(int k=1;k<=n;k++){
				qh[j][k]+=b[j][k];
				qh[j][k]%=mod;
			}
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			cout<<qh[i][j]<<" ";
		}
		cout<<endl;
	}
}