#include<iostream>

#include<cstring>

using namespace std;

#define ll int

ll n, mod, k;

struct jz

{

    ll num[][];

    jz(){ memset(num, , sizeof(num)); }

    jz operator*(const jz&p)const

    {

        jz ans;

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

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

                if (num[i][k] == )continue;

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

                {

                    if (p.num[k][j] == )continue;

                    ans.num[i][j] = (ans.num[i][j] + num[i][k] * p.num[k][j] % mod) % mod;

                }

            }

        }

        return ans;

    }

    jz operator+(const jz&p)const

    {

        jz ans;

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

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

            ans.num[i][j] = (num[i][j] + p.num[i][j]) % mod;

        return ans;

    }

}mat, E;

jz pow(jz x, ll m)

{

    jz ans;

    for (int i = ; i < n; ++i)ans.num[i][i] = ;

    for (; m; m >>= , x = x*x)

    if (m & )ans = ans*x;

    return ans;

}

jz sum(ll h)

{

    if (h == )return mat;

    else if (h & ) return sum(h - ) + pow(mat, h);

    else return (pow(mat, h / ) + E)*sum(h / );

}

int main()

{

    ios::sync_with_stdio(false); cin.tie();

    cin >> n >> k >> mod;

    for (int i = ; i < n; ++i)E.num[i][i] = ;

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

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

        cin >> mat.num[i][j];

    jz ans = sum(k);

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

    {

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

            cout << ans.num[i][j] << " ";

        cout << endl;

    }

}