#include <cstdio>
#include <cmath>

#define incID(i, l, r) for(LL  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; }

// ---- ----

const LL maxv = 10000;

int main() {
	LL x, y, z;
	scanf("%lld%lld%lld", &x, &y, &z);
	
	if(z == 0) {
		printf("ccW\n");
		return 0;
	}
	
	inc(a, maxv) {
	inc(b, maxv) {
		if( 2 * (a + b) + 1 <= maxv && abs(- a * x + b * y) == z ) {
			bool flag = (- a * x + b * y == z);
			if(! flag) { swap(a, 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("W"); }
			printf("\n");
			
			return 0;
		}
	}
	}
	
	printf("mourennaihasimasenn\n");
	
	return 0;
}