#define _USE_MATH_DEFINES
#include <cstdio>
#include <iostream>
#include <sstream>
#include <fstream>
#include <iomanip>
#include <algorithm>
#include <cmath>
#include <complex>
#include <string>
#include <vector>
#include <list>
#include <queue>
#include <stack>
#include <set>
#include <map>
#include <bitset>
#include <numeric>
#include <limits>
#include <climits>
#include <cfloat>
#include <functional>
#include <iterator>
using namespace std;

const int MAX = 10000;

string makeCommand(int x, int y)
{
    if(x < 0){
        string s = makeCommand(y, x);
        for(unsigned i=0; i<s.size(); ++i){
            if(s[i] == 'c')
                s[i] = 'w';
            else if(s[i] == 'w')
                s[i] = 'c';
        }
        return s;
    }

    if(y < 0){
        return string(-y, 'w') + string(x, 'c') +
               string(x - 1, 'C') + string(-y, 'W');
    }
    else{
        return string(x, 'c') + string(y, 'w') +
               string(x + y - 1, 'C');
    }
}

string solve(int x, int y, int z)
{
    if(x == 0 && y == 0){
        if(z == 0)
            return "c";
        else
            return "mourennaihasimasenn";
    }
    else if(x == 0){
        if(z % y == 0 && z / y * 2 - 1 <= MAX)
            return string(z / y, 'w') + string(z / y - 1, 'C');
        else
            return "mourennaihasimasenn";
    }
    else if(y == 0){
        if(z % x == 0 && z / x * 2 - 1 <= MAX)
            return string(z / x, 'c') + string(z / x - 1, 'C');
        else
            return "mourennaihasimasenn";
    }

    for(long long i=-MAX; i<=MAX; ++i){
        long long a = z - x * i;
        if(a % y != 0)
            continue;

        long long j = a / y;
        long long len = abs(i) + abs(j);
        len = len * 2 - 1;
        if(len > MAX)
            continue;

        return makeCommand(i, j);
    }

    return "mourennaihasimasenn";
}

int main()
{
    long long x, y, z;
    cin >> x >> y >> z;

    cout << solve(x, y, z) << endl;

    return 0;
}