# include <iostream>
# include <stdio.h>
# include <string.h>
# include <string>
# include <algorithm>
# include <math.h>

using namespace std;

/******************************/
# define LL long long int
# define _LL __int64
/*****************************/

/*
const int M = 100;
const int MOD = 1e4;
*/

# define M   n*2
# define MOD m

LL n,m,k;


struct Matrix
{
   // int r,c;   //C行R列
    LL m[66][66];
};

Matrix operator * (Matrix a,Matrix b)
{
    Matrix c;
    for(int i=0; i<M; i++) //初始化矩阵
        for(int j=0; j<M; j++)
            c.m[i][j]= 0;

    for(int k=0; k<M; k++)
        for(int i=0; i<M; i++) //实现矩阵乘法
        {
            if(a.m[i][k] <= 0)  continue;  //剪枝
            for(int j=0; j<M; j++)
            {
               // if(b.m[k][j] <= 0)    continue;  //剪枝
                c.m[i][j]=(c.m[i][j]+a.m[i][k]*b.m[k][j]+MOD)%MOD;
            }
        }
    return c;
}

Matrix operator ^ (Matrix a,LL b)
{
    Matrix c;
    for(int i=0; i<M; i++) //初始化单位矩阵
        for(int j=0; j<M; j++)
            c.m[i][j]= ( i == j );

    while(b)
    {
        if(b&1) c= c * a ;
        b >>= 1;
        a = a * a ;
    }

    return c;
}

Matrix operator + (Matrix a,Matrix b)
{
    for(int i=0; i<M; i++)
        for(int j=0; j<M; j++)
            a.m[i][j]=(a.m[i][j]+b.m[i][j]+MOD)%MOD;

    return a;
}

int main()
{
    ios::sync_with_stdio(false);

    while( cin>>n>>k>>m )
    {
        Matrix a;
        memset(a.m,0,sizeof(a.m));

        for(int i=0; i<n; i++)
            for(int j=0; j<n; j++)
                cin >> a.m[i][j];

        for(int i=0;i<n;i++)
            a.m[i+n][i+n]=a.m[i][i+n]=1;

        Matrix c;

        c = a ^ ( k + 1 );

        for(int i=0;i<n;i++)  //减掉单位矩阵。。
            c.m[i][i+n] = (c.m[i][i+n]-1+MOD)%MOD;

        for(int i=0; i<n; i++)
        {
            for(int j=0; j<n; j++)
            {
                if(j) cout<<" ";
                cout<<c.m[i][j+n];
            }
            cout<<endl;
        }

    }
    return 0;
}