#include <bits/stdc++.h>
#define rep(i,n) for(int i=0;i<(n);++i)
#define repi(i,a,b) for(int i=int(a);i<int(b);++i)
#define rrep(i,n) for(int i = (n-1);i>=0;--i)
#define all(x) (x).begin(), (x).end()
using namespace std;
typedef long long ll;
typedef long double ld;
const int INF=1<<30;
//const ll INF=1LL<<60;

ll binomial(ll N, ll K) {
  if(K < 0 || N < K) return 0;
  ll ret = 1;
  for(ll i = 1; i <= K; ++i) {
    ret *= N--;
    ret /= i;
  }
  return ret;
}
 
int main() {

    ll a,b,k;
    cin >> a >> b >> k;

    ll n = a+b;
    string ans;
    ll count = 1;
    rep(i,n) {
        if(count+binomial(n-i,a)-binomial(n-i-1,a) <= k && b>0) {
            count += binomial(n-i,a)-binomial(n-i-1,a);
            ans+='b';
            --b;
        }
        else if(a>0) {
            ans+='a';
            --a;
        }
        else    ans+='b';
    }

    cout<<ans<<endl;


    
 return 0;
}
#include <bits/stdc++.h>

using namespace std;

typedef long long LL;

const int N = 10010;

int a[N];

int main() {
    cin >> a[0] >>a[1] >> a[2];
    sort(a, a + 3);
    cout << a[1] + a[2];


    return 0;
}
