#include <bits/stdc++.h>

using namespace std;

#define lll __int128_t
#define ll long long
#define flt double
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()

const ll inf = 1e18;
mt19937 rnd(234);

int n, k;
ll m;

pair<ll, ll> operator+(const pair<ll, ll> &a, const pair<ll, ll> &b) {
    return make_pair((a.first + b.first) % m, (a.second + b.second) % m);
}

pair<ll, ll> operator-(const pair<ll, ll> &a, const pair<ll, ll> &b) {
    return make_pair((a.first + m - b.first) % m, (a.second + m - b.second) % m);
}

vector<ll> get_biba_slow(int n, int k, ll bebra) {
    vector<ll> rs(n);
    for (int i = 0; i < n; i += 1) {
        vector<pair<ll, ll>> dp = {{1, bebra}};
        int dp_sz = (int)dp.size();
        for (int j = 1; j <= i; j += 1) {
            pair<ll, ll> sm = {0, 0};
            int l = 0;
            int r = 0;
            vector<pair<ll, ll>> new_dp(dp_sz + j);
            int new_dp_sz = dp_sz + j;
            for (int t = 0; t < new_dp_sz; t += 1) {
                while (r < min(t + 1, dp_sz)) {
                    sm = (sm + dp[r]);
                    r += 1;
                }
                while (l < max(0, t - j)) {
                    sm = (sm - dp[l]);
                    l += 1;
                }
                new_dp[t] = sm;
            }
            for (int t = 0; t < dp_sz; t += 1) {
                new_dp[t] = (new_dp[t] + make_pair(0, dp[t].first));
            }
            dp.swap(new_dp);
            dp_sz = (int)dp.size();
        }
        for (int j = i + 1; j <= n - 1; j += 1) {
            pair<ll, ll> sm = {0, 0};
            int l = 0;
            int r = 0;
            vector<pair<ll, ll>> new_dp(dp_sz + j);
            int new_dp_sz = dp_sz + j;
            for (int t = 0; t < new_dp_sz; t += 1) {
                while (r < min(t + 1, dp_sz)) {
                    sm = (sm + dp[r]);
                    r += 1;
                }
                while (l < max(0, t - j)) {
                    sm = (sm - dp[l]);
                    l += 1;
                }
                new_dp[t] = sm;
            }
            dp.swap(new_dp);
            dp_sz = (int)dp.size();
        }
        if (k < dp_sz) {
            rs[i] = dp[k].second;
        }
    }
    return rs;
}

vector<ll> solve_slow() {
    vector<ll> a = get_biba_slow(n, k, 1);
    vector<ll> b = get_biba_slow(n, n * (n - 1) / 2 - k, 0);
    reverse(all(b));
    vector<ll> c(n);
    for (int i = 0; i < n; i += 1) {
        c[i] = (a[i] + b[i]) % m;
    }
    return c;
}

vector<ll> get_biba(int n, int k, ll bebra) {
    vector<vector<ll>> dp_aboba(n + 1);
    dp_aboba[n] = {1};
    int dp_sz = 1;
    for (int j = n - 1; j >= 1; j -= 1) {
        ll sm = 0;
        int l = 0;
        int r = 0;
        int new_dp_sz = dp_sz + j;
        dp_aboba[j].resize(new_dp_sz);
        for (int t = 0; t < new_dp_sz; t += 1) {
            while (r < min(t + 1, dp_sz)) {
                sm = (sm + dp_aboba[j + 1][r]) % m;
                r += 1;
            }
            while (l < max(0, t - j)) {
                sm = (sm + m - dp_aboba[j + 1][l]) % m;
                l += 1;
            }
            dp_aboba[j][t] = sm;
        }
        dp_sz = new_dp_sz;
    }
    vector<ll> rs(n, 0);
    vector<pair<ll, ll>> dp = {{1, bebra}};
    dp_sz = 1;
    for (int i = 0; i < n; i += 1) {
        int dp_sz = (int)dp.size();
        if(i > 0){
            int j = i;
            pair<ll, ll> sm = {0, 0};
            int l = 0;
            int r = 0;
            vector<pair<ll, ll>> new_dp(dp_sz + j);
            int new_dp_sz = dp_sz + j;
            for (int t = 0; t < new_dp_sz; t += 1) {
                while (r < min(t + 1, dp_sz)) {
                    sm = (sm + dp[r]);
                    r += 1;
                }
                while (l < max(0, t - j)) {
                    sm = (sm - dp[l]);
                    l += 1;
                }
                new_dp[t] = sm;
            }
            for (int t = 0; t < dp_sz; t += 1) {
                new_dp[t] = (new_dp[t] + make_pair(0, dp[t].first));
            }
            dp.swap(new_dp);
            dp_sz = (int)dp.size();
        }
        for(int cnt = 0; cnt < dp_sz && cnt <= k; cnt += 1){
            int aboba_dp_sz = (int)dp_aboba[i + 1].size();
            int cnt_aboba = k - cnt;
            if(cnt_aboba < aboba_dp_sz){
                rs[i] = (rs[i] + dp[cnt].second * dp_aboba[i + 1][cnt_aboba]) % m;
            }
        }
    }
    return rs;
}

vector<ll> solve() {
    vector<ll> a = get_biba(n, k, 1);
    vector<ll> b = get_biba(n, n * (n - 1) / 2 - k, 0);
    reverse(all(b));
    vector<ll> c(n);
    for (int i = 0; i < n; i += 1) {
        c[i] = (a[i] + b[i]) % m;
    }
    return c;
}

int32_t main() {
    if (1) {
        ios::sync_with_stdio(0);
        cin.tie(0);
        cout.tie(0);
    }
    cin >> n >> k >> m;
    auto rs = solve();
    for (auto t : rs) {
        cout << t << " ";
    }
    cout << "\n";
    return 0;
}