#include <cstdio>
#include <iostream>
#include <vector>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <string>
#include <cstring>
#include <sstream>
#include <algorithm>
#include <functional>
#include <queue>
#include <stack>
#include <cmath>
#include <iomanip>
#include <list>
#include <tuple>
#include <bitset>
#include <ciso646>
#include <cassert>

using namespace std;

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;
typedef pair<ll, ll> P;
typedef tuple<ll, ll, ll> T;
typedef vector<ll> vec;

inline bool check(ll x, ll y, ll xMax, ll yMax) { return x >= 0 && y >= 0 && xMax > x && yMax > y; }
inline int toint(string s) { int v; istringstream sin(s); sin >> v; return v; }
template<class T> inline string tostring(T x) { ostringstream sout; sout << x; return sout.str(); }
template<class T> inline T sqr(T x) { return x*x; }
template<class T> inline T mypow(T x, ll n) { T res = 1; while (n > 0) { if (n & 1)res = res * x;	x = x * x;	n >>= 1; }return res; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a%b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }

#define For(i,a,b)	for(ll (i) = (a);i < (b);(i)++)
#define rep(i,n)	For(i,0,n)
#define rFor(i,a,b)	for(ll (i) = (a-1);i >= (b);(i)--)
#define rrep(i,n)	rFor(i,n,0)
#define each(i,n)	for(auto &i : n)
#define clr(a)		memset((a), 0 ,sizeof(a))
#define mclr(a)		memset((a), -1 ,sizeof(a))
#define all(a)		(a).begin(),(a).end()
#define sz(a)		(sizeof(a))
#define tostr(a)	tostring(a)
#define dump(val) 	cerr << #val " = " << val << endl;
#define Fill(a,v)	fill((int*)a,(int*)(a+(sz(a)/sz(*(a)))),v)

const ll dx[8] = { 1, 0, -1, 0, 1, 1, -1, -1 }, dy[8] = { 0, -1, 0, 1, -1, 1, -1, 1 };

const ll mod = 1e9 + 7;
const ll INF = 1e17 + 9;

#define int ll
#define double ld

signed main() {
	cin.tie(0);
	ios_base::sync_with_stdio(false);

	int x, y, z;
	cin >> x >> y >> z;

	// a * x + b * y = z
	// a = (z - b * y) / x

	int mi = INF;
	int a = 0, b = 0;

	auto no = [&]() {
		cout << "mourennaihasimasenn" << endl;
		exit(0);
	};

	if (z == 0) {
		cout << "ccW" << endl;
		return 0;
	}else
	if (x == 0 && y == 0) {
		if (z == 0) {
			cout << "cwC" << endl;
			return 0;
		}else no();
	}else
	if (x && y) {
		for (int tb = -20000; tb <= 20000; tb++) {
			int t = (z - tb * y);
			if (t % x) continue;
			int ta = t / x;
			if (mi > abs(ta) + abs(tb) && abs(ta) + abs(tb)) {
				mi = abs(ta) + abs(tb);
				a = ta, b = tb;
			}
		}
		if (mi == INF) {
			no();
		}
	}else{
		if (x == 0) {
			if (z % y) {
				no();
			}
			else b = z / y;
		}
		else {
			if (z % x) {
				no();
			}
			else a = z / x;
		}
	}
	if (abs(a) + abs(b) == 1) {
		if (abs(a)) {
			cout << "cccCW" << endl; return 0;
		}
		else {
			cout << "wwwCW" << endl; return 0;
		}
	}

	string s;
	if (a > 0) {
		s += 'c';
		a--;
	}
	else {
		s += 'w';
		b--;
	}
	for (int i = 0; i < a; i++) {
		s += 'c';
		s += 'C';
	}
	for (int i = 0; i < b; i++) {
		s += 'w';
		s += 'C';
	}

	for (int i = a; i < 0; i++) {
		s += 'W';
		s = 'c' + s;
	}
	for (int i = b; i < 0; i++) {
		s += 'W';
		s = 'w' + s;
	}

	if (s.size() > 10000 || s.size() == 0) {
		cout << "mourennaihasimasenn" << endl;
	}
	else {
		cout << s << endl;
	}
	return 0;
}