#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int,int> pii;
const int N=35;

int t,n,m;
ll a,b,k;
ll f[N][N];
string finds(ll a,ll b,ll k){
    if(!a) return string(b,'b');
    if(!b) return string(a,'a');
    if(f[a-1][b] >= k) return "a" + finds(a-1,b,k);
    else return "b" + finds(a,b-1,k-f[a-1][b]);
}

int main(){
    cin>>a>>b>>k;
    f[0][0] = 1;
    for(int i=0;i<=a;i++)
        for(int j=0;j<=b;j++){
            if(i) f[i][j] += f[i-1][j];
            if(j) f[i][j] += f[i][j-1];
        }

    cout<<finds(a,b,k)<<endl;
    return 0;
}
#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <cassert>

using namespace std;
// using namespace atcoder;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;
typedef pair<ll, vector<ll>> Pd;

const ll INF = 2e18;
const ll fact_table = 3200008;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

// const ll mod = 998244353ll;
// const ll mod = 1000000007ll;

// ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/

bool multicase = false;

// ACLにするのを忘れない

ll mod;
ll dp[105][1000405];

void solve() {
    ll n, k;
    cin >> n >> k >> mod;

    dp[0][0] = 1ll;
    for (ll i = 1; i <= n; i++) {
        ll maxi = i * i * k + 100ll;
        for (ll j = 0; j <= maxi; j++) {
            ll value = (j - i >= 0) ? (dp[i][j - i]) : 0ll;
            value += dp[i - 1][j];
            value %= mod;
            if (j >= i * k + i) value += mod - dp[i - 1][j - i * k - i];
            value %= mod;
            dp[i][j] = value;
        }
    }
    for (ll i = 1; i <= n; i++) {
        // answer query i
        ll maxi = 1000000ll;
        ll ans = 0;
        for (ll j = 0; j <= maxi; j++) {
            ans += (dp[n - i][j] * dp[i - 1][j]) % mod;
            ans %= mod;
        }
        ans *= (k + 1ll);
        ans %= mod;
        ans += mod - 1ll;
        ans %= mod;
        p(ans);
    }
    return;
}

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

    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }

    // solve();
    return 0;
}