#include "bits/stdc++.h"
using namespace std;
#define rep(i,n) for(int (i)=0;(i)<(int)(n);++(i))
#define rer(i,l,u) for(int (i)=(int)(l);(i)<=(int)(u);++(i))
#define reu(i,l,u) for(int (i)=(int)(l);(i)<(int)(u);++(i))
static const int INF = 0x3f3f3f3f; static const long long INFL = 0x3f3f3f3f3f3f3f3fLL;
typedef vector<int> vi; typedef pair<int, int> pii; typedef vector<pair<int, int> > vpii; typedef long long ll;
template<typename T, typename U> static void amin(T &x, U y) { if(y < x) x = y; }
template<typename T, typename U> static void amax(T &x, U y) { if(x < y) x = y; }

int exgcd(int a, int b, int &g) {
	int u = 1, v = 0;
	while(b) {
		int t = a / b;
		a -= t * b; swap(a, b);
		u -= t * v; swap(u, v);
	}
	g = a;
	return u;
}

int main() {
	const int MaxLen = 10000;
	int x; int y; int z;
	while(~scanf("%d%d%d", &x, &y, &z)) {
		string ans;
		if(z == 0) {
			ans = "wwW";
			goto ok;
		}
		rer(aa, -MaxLen / 2, MaxLen / 2) rer(bb, -MaxLen / 2, MaxLen / 2) {
			ll a = aa, b = bb;
			if(a <= 0 && b <= 0) continue;
			ll len = (abs(a) + abs(b)) * 2 - 1;
			if(len > MaxLen) continue;
			if((ll)a * x + (ll)b * y != z) continue;
			if(a > 0) {
				ans += 'c';
				-- a;
			} else {
				ans += 'w';
				-- b;
			}
			string ansL;
			while(a != 0 || b != 0) {
				if(a > 0)
					ans += "cC", -- a;
				else if(a < 0)
					ansL += 'c', ans += "W", ++ a;
				else if(b > 0)
					ans += "wC", -- b;
				else
					ansL += 'w', ans += "W", ++ b;
			}
			reverse(ansL.begin(), ansL.end());
			ans = ansL + ans;
			assert(ans.size() == len);
			goto ok;
		}
	ok:;
		if(ans.empty()) {
			puts("mourennaihasimasenn");
		} else {
			puts(ans.c_str());
			/*
			vector<ll> stk;
			for(char c : ans) {
				if(c == 'c')
					stk.push_back(x);
				if(c == 'w')
					stk.push_back(y);
				if(c == 'C') {
					ll t = stk.end()[-1] + stk.end()[-2];
					stk.pop_back();
					stk.pop_back();
					stk.push_back(t);
				}
				if(c == 'W') {
					ll t = stk.end()[-1] - stk.end()[-2];
					stk.pop_back();
					stk.pop_back();
					stk.push_back(t);
				}
			}
			cerr << z << " = " << stk.back() << endl;
			*/
		}
	}
	return 0;
}