//qoj7759
#include <bits/stdc++.h>
using namespace std;

const int N = 510;
typedef long long ll;
int n, m;
ll P, f[N][N], g[N][N], h[N][N];
ll C[N][N], fac[N*N+N], inv[N*N+N];

ll qp(ll x, ll y){
    ll ans = 1;
    while(y){
        if(y & 1){
            ans = ans * x % P;
        }
        x = x * x % P;
        y >>= 1;
    }
    return ans;
}
int fy(int x){
    return (x&1) ? P-1 : 1;
}
ll Co(int x, int y){
    return fac[x] * inv[y] % P * inv[x-y] % P;
}

int main(){
    cin >> n >> P;
    fac[0] = 1;
    m = n * n + n;
    for(int i = 1; i <= m; ++ i){
        fac[i] = fac[i-1] * i % P;
    }
    inv[m] = qp(fac[m], P-2);
    for(int i = m-1; i >= 0; -- i){
        inv[i] = inv[i+1] * (i+1) % P;
    }
    C[0][0] = 1;
    for(int i = 1; i <= n; ++ i){
        C[i][0] = C[i][i] = 1;
        for(int j = 1; j < i; ++ j){
            C[i][j] = (C[i-1][j] + C[i-1][j-1]) % P;
        }
    }
    for(int x = 1; x <= n; ++ x){
        for(int y = 1; y <= n; ++ y){
            for(int i = 1; i <= y; ++ i){
                h[x][y] = (h[x][y] + C[y][i] * fy(y-i) % P * Co(x*i+n-1, x*i-1)) % P;
            }
            for(int i = 1; i <= x; ++ i){
                g[x][y] = (g[x][y] + C[x][i] * fy(x-i) % P * h[i][y]) % P;
            }
        }
    }
    memset(h, 0, sizeof(h));
    for(int x = 0; x < n; ++ x){
        for(int y = 0; y < n; ++ y){
            for(int i = y; i <= n; ++ i){
                h[x][y] = (h[x][y] + C[i][y] * fy(i-y) % P * g[n-x][n-i]) % P;
            }
        }
    }
    for(int x = 0; x < n; ++ x){
        for(int y = 0; y < n; ++ y){
            for(int i = x; i <= n; ++ i){
                f[x][y] = (f[x][y] + C[i][x] * fy(i-x) % P * h[i][y]) % P;
            }
            printf("%lld ", f[x][y]);
        }
        puts("");
    }
    return 0;
}