#include<bits/stdc++.h>

typedef unsigned int uint;
typedef long long ll;
typedef unsigned long long ull;
typedef double lf;
typedef long double llf;
typedef std::pair<int,int> pii;

#define xx first
#define yy second

template<typename T> inline T max(T a,T b){return a>b?a:b;}
template<typename T> inline T min(T a,T b){return a<b?a:b;}
template<typename T> inline T abs(T a){return a>0?a:-a;}
template<typename T> inline bool repr(T &a,T b){return a<b?a=b,1:0;}
template<typename T> inline bool repl(T &a,T b){return a>b?a=b,1:0;}
template<typename T> inline T gcd(T a,T b){T t;if(a<b){while(a){t=a;a=b%a;b=t;}return b;}else{while(b){t=b;b=a%b;a=t;}return a;}}
template<typename T> inline T sqr(T x){return x*x;}
#define mp(a,b) std::make_pair(a,b)
#define pb push_back
#define I inline
#define mset(a,b) memset(a,b,sizeof(a))
#define mcpy(a,b) memcpy(a,b,sizeof(a))

#define fo0(i,n) for(int i=0,i##end=n;i<i##end;i++)
#define fo1(i,n) for(int i=1,i##end=n;i<=i##end;i++)
#define fo(i,a,b) for(int i=a,i##end=b;i<=i##end;i++)
#define fd0(i,n) for(int i=(n)-1;~i;i--)
#define fd1(i,n) for(int i=n;i;i--)
#define fd(i,a,b) for(int i=a,i##end=b;i>=i##end;i--)
#define foe(i,x)for(__typeof(x.end())i=x.begin();i!=x.end();++i)

struct Cg{I char operator()(){return getchar();}};
struct Cp{I void operator()(char x){putchar(x);}};
#define OP operator
#define RT return *this;
#define RX x=0;char t=P();while((t<'0'||t>'9')&&t!='-')t=P();bool f=0;\
if(t=='-')t=P(),f=1;x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define RL if(t=='.'){lf u=0.1;for(t=P();t>='0'&&t<='9';t=P(),u*=0.1)x+=u*(t-'0');}if(f)x=-x
#define RU x=0;char t=P();while(t<'0'||t>'9')t=P();x=t-'0';for(t=P();t>='0'&&t<='9';t=P())x=x*10+t-'0'
#define TR *this,x;return x;
I bool IS(char x){return x==10||x==13||x==' ';}template<typename T>struct Fr{T P;I Fr&OP,(int &x)
{RX;if(f)x=-x;RT}I OP int(){int x;TR}I Fr&OP,(ll &x){RX;if(f)x=-x;RT}I OP ll(){ll x;TR}I Fr&OP,(char &x)
{for(x=P();IS(x);x=P());RT}I OP char(){char x;TR}I Fr&OP,(char *x){char t=P();for(;IS(t);t=P());if(~t){for(;!IS
(t)&&~t;t=P())*x++=t;}*x++=0;RT}I Fr&OP,(lf &x){RX;RL;RT}I OP lf(){lf x;TR}I Fr&OP,(llf &x){RX;RL;RT}I OP llf()
{llf x;TR}I Fr&OP,(uint &x){RU;RT}I OP uint(){uint x;TR}I Fr&OP,(ull &x){RU;RT}I OP ull(){ull x;TR}};Fr<Cg>in;
#define WI(S) if(x){if(x<0)P('-'),x=-x;char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
#define WL if(y){lf t=0.5;for(int i=y;i--;)t*=0.1;if(x>=0)x+=t;else x-=t,P('-');*this,(ll)(abs(x));P('.');if(x<0)\
x=-x;while(y--){x*=10;x-=floor(x*0.1)*10;P(((int)x)%10+'0');}}else if(x>=0)*this,(ll)(x+0.5);else *this,(ll)(x-0.5);
#define WU(S) if(x){char s[S],c=0;while(x)s[c++]=x%10+'0',x/=10;while(c--)P(s[c]);}else P('0')
template<typename T>struct Fw{T P;I Fw&OP,(int x){WI(10);RT}I Fw&OP()(int x){WI(10);RT}I Fw&OP,(uint x){WU(10);RT}
I Fw&OP()(uint x){WU(10);RT}I Fw&OP,(ll x){WI(19);RT}I Fw&OP()(ll x){WI(19);RT}I Fw&OP,(ull x){WU(20);RT}I Fw&OP()
(ull x){WU(20);RT}I Fw&OP,(char x){P(x);RT}I Fw&OP()(char x){P(x);RT}I Fw&OP,(const char *x){while(*x)P(*x++);RT}
I Fw&OP()(const char *x){while(*x)P(*x++);RT}I Fw&OP()(lf x,int y){WL;RT}I Fw&OP()(llf x,int y){WL;RT}};Fw<Cp>out;

const int N=53;

char s[N],f[N][N][N][N];
int p[N],n,nxt[N][3];

inline bool dfs2(int a,int b,int c,int i)
{
	if(!a&&!b&&!c)
	{
		fo0(j,n)
		{
			if(s[i]>s[j])return 0;
			i=nxt[i][s[j]-97];
		}
		return 1;
	}
	if(~f[a][b][c][i])return f[a][b][c][i];
	bool res=0;
	if(a&&s[i]<='a')res|=dfs2(a-1,b,c,nxt[i][0]);
	if(b&&s[i]<='b')res|=dfs2(a,b-1,c,nxt[i][1]);
	if(c&&s[i]<='c')res|=dfs2(a,b,c-1,nxt[i][2]);
	return f[a][b][c][i]=res;
}

inline bool chk(int n,int a,int b,int c)
{
	//out,"chk:",n,' ',a,' ',b,' ',c,'\n';
	::n=n;
	p[0]=-1;
	fo1(i,n-1)
	{
		int t=p[i-1];
		for(;t!=-1&&s[t+1]!=s[i];t=p[t]);
		if(s[t+1]==s[i])p[i]=t+1;
		else p[i]=-1;
	}
	fo(i,0,n)fo0(j,3)
	{
		int t=i==n?p[i-1]:i-1;
		for(;t!=-1&&s[t+1]!=j+97;t=p[t]);
		if(t+2==n)t=p[t+1]-1;
		if(s[t+1]==j+97)nxt[i][j]=t+2;
		else nxt[i][j]=0;
	}
	//fo(i,0,n)fo0(j,3)out,'/',i,' ',j,' ',nxt[i][j],'\n';
	fo(i,0,a)fo(j,0,b)fo(k,0,c)fo0(d,n)f[i][j][k][d]=-1;
	return dfs2(a,b,c,0);
}

inline void dfs(int a,int b,int c,int i)
{
	//out,a,' ',b,' ',c,' ',i,'\n';
	if(!a&&!b&&!c)return;
	if(c){s[i]='c';if(chk(i+1,a,b,c-1))return dfs(a,b,c-1,i+1);}
	if(b){s[i]='b';if(chk(i+1,a,b-1,c))return dfs(a,b-1,c,i+1);}
	if(a){s[i]='a';if(chk(i+1,a-1,b,c))return dfs(a-1,b,c,i+1);}
}

int main()
{
	int a,b,c;
	in,a,b,c;
	dfs(a,b,c,0);
	out,s,'\n';
}

Measured memory_bytes: 5248