#include <iostream>
#include <cstdio>
#include <vector>
#include <cmath>
#include <cstring>
#include <numeric>
#include <algorithm>
#include <functional>
#include <array>
#include <map>
#include <queue>
#include <limits.h>
#include <set>
#include <stack>
#include <random>
#define rep(i,s,n) for(int i = (s); (n) > i; i++)
#define REP(i,n) rep(i,0,n)
#define RANGE(x,a,b) ((a) <= (x) && (x) <= (b))
#define POWT(x) ((x)*(x))
#define ALL(x) (x).begin(), (x).end()
#define MODI 10000
#define bitcheck(a,b)   ((a >> b) & 1)
#define bitset(a,b)      ( a |= (1 << b))
#define bitunset(a,b)    (a &= ~(1 << b))
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
signed main() {
	int x, y, z;

	scanf("%d %d %d", &x, &y, &z);

	printf("mourennaihasimasenn\n");
	return 0;
	int ax = 20000, ay = 20000;
	REP(i, 10002) {
		REP(j, 10002) {
			if ((i - 5001)*x + (j - 5001)*y == z) {
				if (abs(ax) + abs(ay) > abs(i - 5001) + abs(j - 5001)) {
					ax = i - 5001;
					ay = j - 5001;
				}
			}
		}
	}
	if (ax == 20000) {
		printf("mourennaihasimasenn\n");
		return 0;
	}
	string ans;
	if (ax > 0) {
		REP(i, ax) {
			ans += "c";
		}
		REP(i, ax-1) {
			ans +="C";
		}
	}
	if (ay > 0) {
		REP(i, ay) {
			ans +="w";
		}
		REP(i, ay) {
			if (ax == 0 && ay == 1)
				break;
			ans +="C";
		}
	}
	if (ax < 0) {
		REP(i, abs(ax)) {
			ans +="c";
			ans +="W";
		}
	}
	if (ay < 0) {
		REP(i, abs(ay)) {
			ans +="w";
			ans +="W";
		}
	}
	if (ans.length() > 10000) {
		printf("mourennaihasimasenn\n");
	}
	else printf("%s\n",ans.c_str());
	return 0;
}