#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<ll,ll> pll;

#define F(type, i, a, b, incr) for (type i = a; i <= (type)(b); i += (type)(incr))
#define pb push_back
#define ppb pop_back
#define ff first
#define ss second
#define iter(it, s) for (auto it = s.begin(); it != s.end(); it++)
#define fillc(a,b) memset(a,b,sizeof(a))
#define MOD 1000000007
#define INF 1e17
#define multi_test 0

vector<vector<ll>> v(65,vector<ll>(65,0));

void ncr()
{
	v[0][0]=1;
	for(ll i=1;i<=60;i++)
	{
		v[i][0]=1;
		//cout<<v[i][0]<<" ";
		for(ll j=1;j<=i;j++)
		{
			v[i][j]=v[i-1][j]+v[i-1][j-1];
			//cout<<v[i][j]<<" ";
		}
		//cout<<endl;
	}
}

void solve()
{
	ll a,b,k,i,j;
	cin>>a>>b>>k;
	string s;
	/*for(i=0;i<=60;i++)
	{
		for(j=0;j<=i;j++)
			cout<<v[i][j]<<" ";
		cout<<endl;
	}*/
	for(ll i=0;i<a;i++)
		s+='a';
	for(ll i=0;i<b;i++)
		s+='b';
	//cout<<s<<" ";
	for(ll i=1;i<=b;i++)
	{
		ll p=i+a,c=0;
		//c=v[a+b-p][b-i];
		while(k>c)
		{
			c=v[a+b-p][b-i];
			//cout<<c<<endl;
			if(k>c)
			{
				k-=c;
				swap(s[p-1],s[p-2]);
				p--;
			}
		}
		//cout<<a+b-p<<" "<<b-i<<" "<<c<<endl;;
	}
	cout<<s<<endl;
}

int main()
{
    //freopen("input.txt","r",stdin);freopen("output.txt","w",stdout);
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    ncr();
    int t=1,i;
    if (multi_test)
        cin>>t;
    for(i=1;i<=t;i++)
        solve();
}
/**
 * @author      : xnyuq
 * @created     : 24/05/2021 19:56:30 +07
 * @filename    : abc202d
 */

#include <cstdio>
#include <iostream>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <chrono>
#include <random>
#include <cstdlib>
#include <cmath>
#include <ctime>
#include <cstring>
#include <iomanip>
using namespace std;

template<typename A, typename B> ostream& operator<<(ostream &os, const pair<A, B> &p) { return os << '(' << p.first << ", " << p.second << ')'; }
template<typename T_container, typename T = typename enable_if<!is_same<T_container, string>::value, typename T_container::value_type>::type> ostream& operator<<(ostream &os, const T_container &v) { os << '{'; string sep; for (const T &x : v) os << sep << x, sep = ", "; return os << '}'; }
 
void dbg_out() { cerr << endl; }
template<typename Head, typename... Tail> void dbg_out(Head H, Tail... T) { cerr << ' ' << H; dbg_out(T...); }
#ifdef QUYNX_DEBUG
#define dbg(...) cerr << "(" << #__VA_ARGS__ << "):", dbg_out(__VA_ARGS__)
#else
#define dbg(...)
#endif

const int MX = 35;
vector<vector<int64_t>> dp(MX+1, vector<int64_t>(MX+1));

string findKth(int A, int B, int64_t K) {
    if (A == 0) return string(B, 'b');
    if (B == 0) return string(A, 'a');
    if (K <= dp[A-1][B]) return "a" + findKth(A-1, B, K);
    else return "b" + findKth(A, B - 1, K - dp[A-1][B]);
}

int main() {
    ios_base::sync_with_stdio(false);
#ifndef QUYNX_DEBUG 
    cin.tie(nullptr);
#endif
    int A, B;
    int64_t K;
    cin >> A >> B >> K;
    dp[0][0] = 1;
    for (int i = 0; i <= A; ++i) {
        for (int j = 0; j <= B; ++j) {
            if (i) dp[i][j] += dp[i-1][j];
            if (j) dp[i][j] += dp[i][j-1];
        }
    }
    cout << findKth(A,B,K) << "\n";
}

