#include <bits/stdc++.h>

int ri() {
	int n;
	scanf("%d", &n);
	return n;
}

int main() {
	int n = ri();
	int k = ri();
	int m = ri();
	
	
	auto add = [&] (int &a, int b) {
		a += b;
		if (a >= m) a -= m;
	};
	
	std::vector<std::vector<int> > dp(n + 1);
	dp[0] = { 1 };
	for (int i = 1; i < n; i++) {
		dp[i].resize(dp[i - 1].size() + k * i);
		for (int j = 0; j < (int) dp[i - 1].size(); j++) {
			int cur = dp[i - 1][j];
			add(dp[i][j], cur);
			if (j + (k + 1) * i < (int) dp[i].size()) add(dp[i][j + (k + 1) * i], m - cur);
		}
		for (int j = 0; j + i < (int) dp[i].size(); j++) add(dp[i][j + i], dp[i][j]);
	}
	
	/*
	for (auto i : dp) {
		for (auto j : i) std::cerr << j << " ";
		std::cerr << std::endl;
	}*/
	
	for (int i = 0; i < n; i++) {
		auto &r0 = dp[i];
		auto &r1 = dp[n - 1 - i];
		int res = 0;
		for (int j = 0; j < (int) r0.size() && j < (int) r1.size(); j++) res = (res + (int64_t) r0[j] * r1[j]) % m;
		res = ((int64_t) res * (k + 1)) % m;
		if (--res < 0) res += m;
		printf("%d\n", res);
	}
	
	return 0;
}

#include <bits/stdc++.h>
using namespace std;
#define pb push_back
#define mp make_pair
#define endl '\n'
#define D(x) cerr << #x << " = " << (x) << '\n'
#define sz(x) ((int)(x).size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
typedef long long ll;

const int N = 102;

int n, k, mod;
int dp[N][N * N * N];
int acc[N];

int main()
{
  cin >> n >> k >> mod;
  dp[0][0] = 1;
  int mxs = k * n * (n - 1) / 2;
  for(int i = 1; i <= n; i++) {
    for(int j = 0; j < i; j++)
      acc[j] = 0;
    for(int j = 0; j <= mxs; j++) {
      acc[j % i] += dp[i - 1][j];
      if(j - (k + 1) * i >= 0) {
        acc[j % i] -= dp[i - 1][j - (k + 1) * i];
      }
      acc[j % i] %= mod;
      dp[i][j] = (acc[j % i] % mod + mod) % mod;
    }
  }

  for(int m = 1; m <= n; m++) {
    int ans = -1;
    for(int sum = 0; sum <= mxs; sum++) {
      ans += 1LL * dp[m - 1][sum] * dp[n - m][sum] % mod * (k + 1) % mod;
      ans %= mod;
    }
    ans = (ans + mod) % mod;
    cout << ans << endl;
  }

  return 0;
}
