#include <iostream>
#include <string>
#include <cmath>
#include<algorithm>
#include<stack>
#include<queue>
#include<map>
#include<set>
#include<iomanip>
#define _USE_MATH_DEFINES
#include <math.h>
#include <functional>
#include<complex>
#include<cassert>
using namespace std;

#define rep(i,x) for(ll i=0;i<x;i++)
#define repn(i,x) for(ll i=1;i<=x;i++)

typedef long long ll;
const ll INF = 1e17;
const ll MOD = 1000000007;
const ll MAX = 4000001;
const long double eps = 1E-14;

ll max(ll a, ll b) {
	if (a > b) { return a; }
	return b;
}

ll min(ll a, ll b) {
	if (a > b) { return b; }
	return a;
}

ll gcd(ll a, ll b) {
	if (b == 0) { return a; }
	if (a < b) { return gcd(b, a); }
	return gcd(b, a % b);
}

ll lcm(ll a, ll b) {
	return a / gcd(a, b) * b;
}

struct edge {
	ll ind;
	ll fr;
	ll to;
	ll d;
};

class mint {
	long long x;
public:
	mint(long long 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 {
		mint res(*this);
		return res += a;
	}
	mint operator-(const mint& a) const {
		mint res(*this);
		return res -= a;
	}
	mint operator*(const mint& a) const {
		mint res(*this);
		return res *= 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 {
		mint res(*this);
		return res /= a;
	}

	friend ostream& operator<<(ostream& os, const mint& m) {
		os << m.x;
		return os;
	}
};

mint pw(mint a, ll b) {
	if (b == 0) { return 1; }
	mint ret = pw(a, b >> 1);
	ret *= ret;
	if (b & 1) { ret *= a; }
	return ret;
}

typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<vector<vector<ll>>> vvvll;

typedef vector<mint> vmint;
typedef vector<vector<mint>> vvmint;
typedef vector<vector<vector<mint>>> vvvmint;

/////////////////////////////////////
ll X, Y, Z;
ll M;


bool ch(string s) {
	//cout << s << endl;

	ll N = s.size();

	vvll lis(N+1);
	rep(i, N+1) {
		//cout << i << endl;
		for (ll j = i; j <= N; j++) {
			if (s.substr(0, i) > s.substr(j - i, i)) { return false; }
			if (s.substr(0, i) == s.substr(j - i, i)) {
				lis[j].push_back(i);
				//cout << j << " ";
			}
		}
		//cout << endl;
	}

	vector<vvvll> dp(M + 1, vvvll(N + 1, vvll(X + 1, vll(Y + 1, 0))));
	
	ll xx = X; ll yy = Y;
	
	rep(i, N) {
		if (s[i] == 'a') { xx--; }
		if (s[i] == 'b') { yy--; }
	}
	if (xx < 0 || yy < 0||xx+yy>M-N) { return false; }
	dp[N][N][xx][yy] = 1;

	for (ll i = N; i < M; i++)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {
		if (dp[i][j][x][y] == 0) { continue; }

		vll d(3,0);
		for (ll w : lis[j]) {
			if (w == N) { continue; }
			rep(k, 3) {
				if (s[w] - 'a' > k) { d[k] = -1; }
				else if (s[w] - 'a' == k) { d[k] = w + 1; }
			}
		}

		if (d[0] != -1 && x > 0)dp[i + 1][d[0]][x - 1][y] = 1;
		if (d[1] != -1 && y > 0) { dp[i + 1][d[1]][x][y - 1] = 1; }
		if (d[2] != -1 && i + x + y < M) { dp[i + 1][d[2]][x][y] = 1; }
	}

	//rep(i, M + 1)rep(j, N + 1)rep(x, X + 1)rep(y, Y + 1) {
	//	if (dp[i][j][x][y] == 1) { cout << i << j << x << y << endl; }
	//}

	rep(j, N + 1) {
		if (dp[M][j][0][0] == 0) { continue; }

		bool b = 1;
		rep(k, j + 1) {
			string t = s.substr(j - k, k) + s.substr(0, N - k);
			if (t < s) { b = 0; }
		}

		if (b) { return true; }
	}

	return false;
}

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

	
	cin >> X >> Y >> Z;
	M = X + Y + Z;


	string s = "";

	rep(i, M) {
		if (ch(s + 'c')) { s += 'c'; }
		else if (ch(s + 'b')) { s += 'b'; }
		else if (ch(s + 'a')) { s += 'a'; }
	}
	cout << s << endl;
}


Measured memory_bytes: 20320