#include <bits/stdc++.h>

#define _overload(_1,_2,_3,name,...) name
#define _rep(i,n) _range(i,0,n)
#define _range(i,a,b) for(int i=int(a);i<int(b);++i)
#define rep(...) _overload(__VA_ARGS__,_range,_rep,)(__VA_ARGS__)

#define _rrep(i,n) _rrange(i,n,0)
#define _rrange(i,a,b) for(int i=int(a)-1;i>=int(b);--i)
#define rrep(...) _overload(__VA_ARGS__,_rrange,_rrep,)(__VA_ARGS__)

#define _all(arg) begin(arg),end(arg)
#define uniq(arg) sort(_all(arg)),(arg).erase(unique(_all(arg)),end(arg))
#define getidx(ary,key) lower_bound(_all(ary),key)-begin(ary)
#define clr(a,b) memset((a),(b),sizeof(a))
#define bit(n) (1LL<<(n))
#define popcount(n) (__builtin_popcountll(n))

using namespace std;

template<class T>bool chmax(T &a, const T &b) { return (a<b)?(a=b,1):0;}
template<class T>bool chmin(T &a, const T &b) { return (b<a)?(a=b,1):0;}

using ll=long long;
// Problem Specific Parameter:

// Description: Chinese Remainder Theorm
// TimeComplexity: $\mathcal{O}(\log|m|)$ 
// Verifyed: CF 724 C

inline tuple<ll,ll,ll> extgcd(ll a,ll b){
	ll x=1LL,y=0LL,g=a;
	if(b!=0){
		tie(g,y,x)=extgcd(b,a%b);
		y-=a/b*x;
	}
	return make_tuple(g,x,y);
}

const int limit=10000;

int main(void){
	ll x,y,z;
	cin >> x >> y >> z;
	string ans="";

	if(z==0){
		ans="wwW";
	}else if(x==0 and y==0){
		ans="mourennaihasimasenn";
	}else{
		ll a,b,g;
		tie(g,a,b)=extgcd(x,y);
		a*=z/g,b*=z/g;

		if(z%g==0){
			//cout << a << " " << b << endl;
			while(abs(a)+abs(b)>abs(a-y/g)+abs(b+x/g)) a-=y/g,b+=x/g;
			while(abs(a)+abs(b)>abs(a+y/g)+abs(b-x/g)) a+=y/g,b-=x/g;
			//cout << a << " " << b << endl;
			ans="";
			if(abs(a)+abs(b)>limit){
				ans="mourennaihasimasenn";
			}else if(a >= 0 and b >= 0){
				ans+=string(abs(a),'c');
				ans+=string(abs(b),'w');
				ans+=string(abs(a)+abs(b)-1,'C');
			}else if(a >= 0 and b <= 0){
				ans+=string(abs(b),'w');
				ans+=string(abs(a),'c');
				ans+=string(abs(a)-1,'C');
				ans+=string(abs(b),'W');		
			}else if(a <= 0 and b >= 0){
				ans+=string(abs(a),'c');
				ans+=string(abs(b),'w');
				ans+=string(abs(b)-1,'C');
				ans+=string(abs(a),'W');
			}
		}else
			ans="mourennaihasimasenn";
	}

	if(ans.size()>limit) ans="mourennaihasimasenn";
	cout << ans << endl;
	return 0;
}