#include<iostream>
#include<vector>
#include<string>
#include<cstring>
#include<algorithm>
#include<map>
#include<set>

using namespace std;
typedef long long ll;

int main() {
	const string no = "mourennaihasimasenn"; 
	ll x, y, z;
	cin >> x >> y >> z;
	if (x*y == 0) {
		if (x == 0) {
			if (y == 0) {
				if (z == 0) cout << "w" << endl;
				else cout << no << endl;
			} else {
				if (z%y == 0) {
					ll num = z/y;
					if (2*num-1 <= 10000) {
						string ans;
						for (int i = 0; i < num; ++i)
							ans += 'w';
						for (int i = 0; i < num-1; ++i)
							ans += 'C';
						cout << ans << endl;
					} else cout << no << endl;
				} else {
					cout << no << endl;
				}
			}
		} else {
			if (z%x == 0) {
				ll num = z/x;
				if (2*num-1 <= 10000) {
					string ans;
					for (int i = 0; i < num; ++i)
						ans += 'c';
					for (int i = 0; i < num-1; ++i)
						ans += 'C';
					cout << ans << endl;
				} else cout << no << endl;
			} else {
				cout << no << endl;
			}
		}
		return 0;
	}
	for (int i = 0; i < 6000; ++i) {
		ll tmp = i*x;
		if (tmp > z) {
			ll rest = tmp-z;
			if (rest%y == 0) {
				ll j = rest/y;
				if (2*i+2*j-1 <= 10000) {
					string ans;
					for (int k = 0; k < j; ++k)
						ans += 'w';
					for (int k = 0; k < i; ++k)
						ans += 'c';
					for (int k = 0; k < i-1; ++k)
						ans += 'C';
					for (int k = 0; k < j; ++k)
						ans += 'W';
					cout << ans << endl;
					return 0;
				}
			}
		} else if (tmp == z) {
			string ans;
			if (2*i-1 <= 10000) {
				for (int k = 0; k < i; ++k)
					ans += 'c';
				for (int k = 0; k < i-1; ++k)
					ans += 'C';
				cout << ans << endl;
				return 0;
			}
		} else {
			ll rest = z-tmp;
			if (rest%y == 0) {
				ll j = rest/y;
				if (2*i+2*j-1 <= 10000) {
					string ans;
					for (int k = 0; k < j; ++k)
						ans += 'w';
					for (int k = 0; k < i; ++k)
						ans += 'c';
					for (int k = 0; k < i+j-1; ++k)
						ans += 'C';
					cout << ans << endl;
					return 0;
				}
			}
		}
	}
	cout << no << endl;
	return 0;
}