#ifdef LOCAL
#include "stdafx.h"
#else
#include <bits/stdc++.h>
#define IL inline
#define LL long long
#define eb emplace_back
#define sz(v) static_cast<int>((v).size())
#define L(i, j, k) for (int i = (j); i <= (k); ++i)
#define R(i, j, k) for (int i = (j); i >= (k); --i)
#define FIO(FILE) freopen(FILE".in", "r", stdin), freopen(FILE".out", "w", stdout)
using namespace std;

using vi = vector<int>;
#endif

constexpr int N = 507;
int n, P;

using ui = unsigned;
using ull = unsigned long long;
using u128 = __uint128_t;

struct Barret {
  ui m;
  ull B;

  explicit Barret (ui p = 2) : 
    m(p), B(ull(-1) / p + 1) {}

  ui operator () (ull x) const {
    ull y = (u128(B) * x) >> 64;
    ull z = y * m;
    return x - z + (x < z ? m : 0);
  }
} mod;

IL void qm (int &x) {
  x += x >> 31 & P;
}

IL constexpr int qpow (int b, int k = P - 2) {
  int r = 1;
  for (; k; k >>= 1, b = mod((LL)b * b)) if (k & 1) r = mod((LL)r * b);
  return r;
}

int fc[N], ifc[N], C[N][N];

void init (int Z) {
  fc[0] = 1;
  L (i, 1, Z) {
    fc[i] = mod((LL)fc[i - 1] * i);
  }
  ifc[Z] = qpow(fc[Z]);
  R (i, Z - 1, 0) {
    ifc[i] = mod((LL)ifc[i + 1] * (i + 1));
  }
  L (i, 0, Z) {
    C[i][0] = 1;
    L (j, 1, i) {
      qm(C[i][j] = C[i - 1][j] + C[i - 1][j - 1] - P);
    }
  }
}

int f[N][N];

IL int com (int x) {
  int ret = ifc[n];
  L (i, 1, n) {
    ret = mod((LL)ret * (x + n - i));
  }
  return ret;
}

IL int sgn (int x) {
  return x & 1 ? -1 : 1;
}

int main () {
  ios::sync_with_stdio(0), cin.tie(0);
  cin >> n >> P;
  mod = Barret(P);
  init(n);
  L (i, 0, n) {
    L (j, 0, n) {
      f[i][j] = com(mod((LL)i * j));
    }
  }
  L (i, 0, n) {
    R (j, n, 0) {
      __int128 cur = 0;
      L (k, 0, j) {
        cur += (LL)sgn(k) * f[i][j - k] * C[j][k];
      }
      f[i][j] = (cur % P + P) % P;
    }
  }
  L (j, 0, n) {
    R (i, n, 0) {
      __int128 cur = 0;
      L (k, 0, i) {
        cur += (LL)sgn(k) * f[i - k][j] * C[i][k];
      }
      f[i][j] = (cur % P + P) % P;
    }
  }
  L (i, 0, n) {
    R (j, n, 0) {
      __int128 cur = 0;
      L (k, 0, j) {
        cur += (LL)sgn(j - k) * C[n - k][n - j] * f[i][k];
      }
      f[i][j] = (cur % P + P) % P;
    }
  }
  L (j, 0, n) {
    R (i, n, 0) {
      __int128 cur = 0;
      L (k, 0, i) {
        cur += (LL)sgn(i - k) * C[n - k][n - i] * f[k][j];
      }
      f[i][j] = (cur % P + P) % P;
    }
  }
  L (i, 0, n - 1) {
    L (j, 0, n - 1) {
      cout << f[n - i][n - j] << ' ';
    }
    cout << '\n';
  }
}
// I love WHQ!