#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;

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

int fc[N], ifc[N];

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

IL int C (int n, int m) {
  return (LL)fc[n] * ifc[m] % P * ifc[n - m] % P;
}

int f[N][N], g[N][N];

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

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

void copy () {
  L (i, 0, n) {
    L (j, 0, n) {
      f[i][j] = g[i][j];
    }
  }
}

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