#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(int i = (l)    ; i <  (r); i++)
#define incII(i, l, r) for(int i = (l)    ; i <= (r); i++)
#define decID(i, l, r) for(int i = (r) - 1; i >= (l); i--)
#define decII(i, l, r) for(int i = (r)    ; i >= (l); i--)
#define inc( i, n) incID(i, 0, n)
#define inc1(i, n) incII(i, 1, n)
#define dec( i, n) decID(i, 0, n)
#define dec1(i, n) decII(i, 1, n)

typedef long long   signed int LL;
typedef long long unsigned int LU;

template<typename T> void swap(T &x, T &y) { T t = x; x = y; y = t; return; }
template<typename T> T abs(T x) { return (0 <= x ? x : -x); }
template<typename T> T max(T a, T b) { return (b <= a ? a : b); }
template<typename T> T min(T a, T b) { return (a <= b ? a : b); }
template<typename T> bool setmin(T &a, T b) { if(a <= b) { return false; } else { a = b; return true; } }
template<typename T> bool setmax(T &a, T b) { if(b <= a) { return false; } else { a = b; return true; } }
template<typename T> T gcd(T a, T b) { return (b == 0 ? a : gcd(b, a % b)); }
template<typename T> T lcm(T a, T b) { return a / gcd(a, b) * b; }

// ---- ----  多分 WA

int ex_gcd(int a, int b, int & x, int & y) {
	int d = a;
	if(b != 0) {
		d = ex_gcd(b, a % b, y, x);
		y -= (a / b) * x;
	} else { x = 1; y = 0; }
	
	return d;
}

int main() {
	int x, y, z;
	scanf("%d%d%d", &x, &y, &z);
	
	if(x == 0 && y == 0) {
		if(z == 0) { printf("ccW\n"); return 0; }
		else { printf("mourennaihasimasenn\n"); return 0; }
	}
	
	int a, b, d;
	d = ex_gcd(x, y, a, b);
	a *= z / d;
	b *= z / d;
	
	if(z % d == 0 && 2 * (abs(a) + abs(b)) - 1 <= 10000) {
		bool flag = true;
		if(a < 0) { flag = false; swap(a, b);  b = abs(b); }
		
		inc(i, a) { printf(flag ? "c" : "w"); }
		inc(i, b) { printf(flag ? "w" : "c"); }
		inc(i, b) { printf(i == 0 ? "" : "C"); }
		inc(i, a) { printf(i == 0 && b != 0 ? "W" : "C"); }
		printf("\n");
	} else {
		printf("mourennaihasimasenn\n");
	}
	
	return 0;
}