#include <cstdio>
#include <algorithm>
#include <iostream>
#include <string>
#include <cstring>
#include <vector>
#include <set>
#include <map>
using namespace std;

int a, b, c, xa, xb, xc;
string AA, BB, CC, ss[110];

void iter() {
	for (int i = 0; i < a; i++)
		ss[i] = AA;
	// int now = 0;
	for (int i = 0; i < c; i++) {
		ss[i % a] += CC;
	}
	int ll = 0;
	if (c % a == 0)
		ll = 0;
	else
		ll = (c - 1) % a + 1;
	int now = ll;
	for (int i = 0; i < b; i++) {
		ss[now] += BB;
		now += 1;
		if (now >= a)
			now = ll;
	}
	sort(ss, ss + a);
	// for ()
	int cnt = 0;
	xa = xb = xc = 0;
	for (int i = 0; i < a; i++) {
		if (i == 0 || ss[i] != ss[i - 1]) {
			cnt += 1;
			if (cnt == 1)
				AA = ss[i];
			else if (cnt == 2)
				BB = ss[i];
			else CC = ss[i];
		}
		if (cnt == 1)
			xa += 1;
		else if (cnt == 2)
			xb += 1;
		else xc += 1;
	}
	a = xa;
	b = xb;
	c = xc;
}

string solve() {
	AA = "a";
	BB = "b";
	CC = "c";
	if (a == 0) {
		a = b; b = c; c = 0;
		AA = BB; BB = CC;
	}
	string ans = "";
	if (a == 0) {
		for (int i = 0; i < c; i++)
			ans += "c";
		// printf("\n");
		// return 0;
		return ans;
	}
	while (b + c > 0) {
		iter();
	}
	while (a--) {
		// cout << AA;
		ans += AA; 
		// return
	}
	return ans;
	// cout << endl;
}

int main() {
	scanf("%d%d%d", &a, &b, &c);
	// for (int aa = 0; aa <= 50; aa++)
	// 	for (int bb = 0; bb <= 50; bb++)
	// 		for (int cc = 0; cc <= 50; cc++)
	// 			if (aa + bb + cc > 0 && aa + bb + cc <= 50) {
	// 				// int aa = a, bb = b, cc = c;
	// 				a = aa;
	// 				b = bb;
	// 				c = cc;
	// 				cout << aa << ' ' << bb << ' ' << cc << ' '<< solve() << endl;;
	// 			}
	string ans = solve();
	cout << ans << endl;
}
