#include <bits/stdc++.h>

constexpr int N = 502;

int n, mod;



int fac[N * N], inv[N * N], ifac[N * N];
int a[N][N], ha[N][N], b[N][N], hb[N][N];
int C(int n, int m) {
    if (n < 0 || m < 0 || n - m < 0) return 0;
    return 1ll * fac[n] * ifac[m] % mod * ifac[n - m] % mod;
}

int main() {
    std::cin >> n >> mod;
    fac[0] = inv[0] = ifac[0] = 1;
    fac[1] = inv[1] = ifac[1] = 1;
    for (int i = 2; i < N * N; i++) {
        fac[i] = 1ll * fac[i - 1] * i % mod;
        inv[i] = 1ll * (mod - mod / i) * inv[mod % i] % mod;
        ifac[i] = 1ll * ifac[i - 1] * inv[i] % mod;
    }
    for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++) a[i][j] = C(n + i * j - 1, i * j - 1);
    for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++)
        for (int k = 0; k <= j; k++) ha[i][j] = (ha[i][j] + (j - k & 1 ? -1ll : 1ll) * C(j, k) * a[i][k]) % mod;
    for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++)
        for (int k = 0; k <= i; k++) b[n - i][n - j] = (b[n - i][n - j] + (i - k & 1 ? -1ll : 1ll) * C(i, k) * ha[k][j]) % mod;
    for (int i = 0; i <= n; i++) for (int j = 0; j <= n; j++)
        for (int k = j; k <= n; k++) hb[i][j] = (hb[i][j] + (k - j & 1 ? -1ll : 1ll) * C(k, j) * b[i][k]) % mod;
    for (int i = 0; i < n; i++) for (int j = 0; j < n; j++) {
        int sum = 0;
        for (int k = i; k <= n; k++) sum = (sum + (k - i & 1 ? -1ll : 1ll) * C(k, i) * hb[k][j]) % mod;
        printf("%d%c", (sum + mod) % mod, " \n"[j + 1 == n]);
    }
    return 0;
}