#include<cstdio>

 #include<cstring>

 int n,k,p,d;//d = 2*n

 struct matrix

 {

     int m[][];

 } A;

 matrix mul(int a[][],int b[][])

 {

     matrix ans;

     memset(ans.m,,sizeof(ans.m));

     for(int i=; i<=d; ++i)

         for(int j=; j<=d; ++j)

             for(int k=; k<=d; ++k)

                 ans.m[i][j] = (ans.m[i][j] + a[i][k]*b[k][j]%p)%p;

     return ans;

 }

 matrix qPow()

 {

     matrix ans;

     memset(ans.m,,sizeof(ans.m));

     for(int i=; i<=d; ++i)

         ans.m[i][i] = ;

     while(k)

     {

         if(k&) ans = mul(ans.m,A.m);

         A = mul(A.m,A.m);

         k >>= ;

     }

     return ans;

 }

 int main()

 {

 //    freopen("in.txt","r",stdin);

     while(~scanf("%d%d%d",&n,&k,&p))

     {

         memset(A.m,,sizeof(A.m));

         int t[][];

         for(int i=; i<=n; ++i)

         {

             for(int j=; j<=n; ++j)

             {

                 scanf("%d",&A.m[i][j]);

                 t[i][j] = A.m[i][j];

             }

         }

         for(int i=n+; i<=*n; ++i)

             A.m[i][i-n] = ,A.m[i][i] = ;

         d = n<<;

         matrix ans = qPow();

         for(int i=n+; i<=d; ++i)

         {

             for(int j=; j<=n; ++j)

             {

                 int res =;

                 for(int k=; k<=n; ++k)

                     res = (res + ans.m[i][k]*t[k][j]%p)%p;

                 if(j != ) printf(" ");

                 printf("%d",res);

             }

             puts("");

         }

     }

     return ;

 }