#include <bits/stdc++.h>
#include <cstdlib>
#include <cmath>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<int,int>;
using Graph= vector<vector<int>>; 
#define rep(i,n) for (ll i=0; i < (n); ++i)
#define rep2(i,n,m) for(ll i=n;i<=m;i++)
#define rep3(i,n,m) for(ll i=n;i>=m;i--)
#define pb push_back
#define eb emplace_back
#define ppb pop_back
#define fi first 
#define se second
#define mpa make_pair
const ll INF=1e18 ;
inline void chmax(ll& a,ll b){a=max(a,b);}
inline void chmin(ll& a,ll b){a=min(a,b);}
ll gcd(ll a, ll b) { return b?gcd(b,a%b):a;}
ll lcm(ll a, ll b) { return a/gcd(a,b)*b;}
// ミント

const ll mod = //1e9+7 ;
  998244353;

struct mint {
  ll x; // typedef long long ll;
  mint(ll x=0):x((x%mod+mod)%mod){}
  mint operator-() const { return mint(-x);}
  mint& operator+=(const mint a) {
    if ((x += a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator-=(const mint a) {
    if ((x += mod-a.x) >= mod) x -= mod;
    return *this;
  }
  mint& operator*=(const mint a) { (x *= a.x) %= mod; return *this;}
  mint operator+(const mint a) const { return mint(*this) += a;}
  mint operator-(const mint a) const { return mint(*this) -= a;}
  mint operator*(const mint a) const { return mint(*this) *= a;}
  mint pow(ll t) const {
    if (!t) return 1;
    mint a = pow(t>>1);
    a *= a;
    if (t&1) a *= *this;
    return a;
  }

  // for prime mod
  mint inv() const { return pow(mod-2);}
  mint& operator/=(const mint a) { return *this *= a.inv();}
  mint operator/(const mint a) const { return mint(*this) /= a;}
};
istream& operator>>(istream& is, const mint& a) { return is >> a.x;}
ostream& operator<<(ostream& os, const mint& a) { return os << a.x;}
//昆布
struct combination {
  vector<mint> fact, ifact;
  combination(int n):fact(n+1),ifact(n+1) {
    assert(n < mod);
    fact[0] = 1;
    for (int i = 1; i <= n; ++i) fact[i] = fact[i-1]*i;
    ifact[n] = fact[n].inv();
    for (int i = n; i >= 1; --i) ifact[i-1] = ifact[i]*i;
  }
  mint operator()(int n, int k) {
    if (k < 0 || k > n) return 0;
    return fact[n]*ifact[k]*ifact[n-k];
  }
  mint p(int n,int k){
    return fact[n]*ifact[n-k] ;
  }
  } ;
 
mint modpow(ll a,ll b){
 if(b==0) return 1 ;
 mint c= modpow(a,b/2) ;
 if(b%2==1) return c*c*a ;
 else return c*c ;
}

mint komb(ll n,ll m){
  mint x=1 ;mint y=1 ;
  rep(i,m){
    x*= n-i ;
    y*= i+1 ;
  }
  return x/y ;
}

 map<ll,ll> factor(ll n){  //素因数とオーダーをマップで管理
  map <ll,ll> ord ;  
  for(ll i=2;i*i<=n;i++){
        if(n%i==0){
            int res=0;
            while(n%i==0){
                n/=i;
                res++;
            }
            ord[i]=res;
        }
    }
   if(n!=1) ord[n]++;
   return ord ;
 }
///
template< typename T >
T extgcd(T a, T b, T &x, T &y) {
  T d = a;
  if(b != 0) {
    d = extgcd(b, a % b, y, x);
    y -= (a / b) * x;
  } else {
    x = 1;
    y = 0;
  }
  return d;
}
////
struct UnionFind {
  vector<int> d;
  UnionFind(int n=0): d(n,-1) {}
  int find(int x) {
    if (d[x] < 0) return x;
    return d[x] = find(d[x]);
  }
  bool unite(int x, int y) {
    x = find(x); y = find(y);
    if (x == y) return false;
    if (d[x] > d[y]) swap(x,y);
    d[x] += d[y];
    d[y] = x;
    return true;
  }
  bool same(int x, int y) { return find(x) == find(y);}
  int size(int x) { return -d[find(x)];}
};
mint dp[3005][3005] ;
mint rui[3005][3005] ;
int main(){
ll n,k ; cin>>n>>k ;
rep2(i,1,3000) dp[i][i]=1 ;
rep2(i,1,n-k){
  
  rep2(j,1,i-1){
    mint now=0ll ;
    //rep2(qq,1,min(2*j,i-j)) now+= dp[i-j][qq] ; 
    now= rui[i-j][min(2*j,i-j)] ;
    dp[i][j]=now ;
  }
  rep2(ww,1,i) rui[i][ww]=rui[i][ww-1]+dp[i][ww] ;
}
mint ans= 0 ;
rep2(i,1,min(n-k,k)) ans+= dp[n-k][i] ;
if((n-k)==0) cout<<1<<endl ;
else cout<<ans<<endl ;
 return 0;
  }
   


#include <bits/stdc++.h>

using namespace std;

using ll = long long;

constexpr char newl = '\n';

ll dp[100][200000 + 10];

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n, K;
    ll m;
    cin >> n >> K >> m;

    int lim_sum = (n - 1) / 2;
    lim_sum = lim_sum * (lim_sum + 1) / 2 * K;

    dp[0][0] = 1;
    for (int i = 1; i < n; i++) {
        int max_sum = min((i - 1) * i / 2 * K, lim_sum);
        for (int j = 0; j <= max_sum; j++) {
            if (dp[i - 1][j] == 0) continue;
            for (int k = 0; k <= K; k++) {
                if (j + k * i > lim_sum) break;
                dp[i][j + k * i] += dp[i - 1][j];
                if (dp[i][j + k * i] >= m) dp[i][j + k * i] -= m;
            }
        }
    }
    
    for (int i = 1; i <= n; i++) {
        int li = i - 1;
        int ri = n - i;
        int mini = min(li, ri);
        int max_sum = mini * (mini + 1) / 2 * K;

        ll ans = 0;
        for (int j = 0; j <= max_sum; j++) {
            (ans += dp[li][j] * dp[ri][j] % m);
            if (ans >= m) ans -= m;
        }
        ans = (ans * (K + 1) + m - 1) % m;
        cout << ans << newl;
    }
    return 0;
}
