/*
 * Problem link
 * http://yukicoder.me/problems/1100
 */
#include<bits/stdc++.h>
using namespace std;

struct cww{cww(){cin.tie(0);ios_base::sync_with_stdio(false);} }star;

typedef long long LL;

// a x + b y = gcd(a, b)
// O(log (a+b) )
LL extgcd(LL a, LL b, LL &x, LL &y) {
    LL g = a; x = 1; y = 0;
    if (b != 0) g = extgcd(b, a % b, y, x), y -= (a / b) * x;
    return g;
}
LL gcd(LL a,LL b){
    return (b==0)?a:gcd(b,a%b);
}
LL lcm(LL a,LL b){
    return (a*b)/gcd(a,b);
}

inline bool inner(LL x,LL lb,LL ub) {
    return(lb <= x && x <= ub);
}
#define SZ 10000

int main() {
    LL x, y, z;
    cin >> x >> y >> z;
    assert(inner(x, 0, 100000000));
    assert(inner(y, 0, 100000000));
    assert(inner(z, 0, 100000000));
    /*多分分けなくてもいいけどz=0は分けたほうが楽だと思います．*/
    if (z == 0)
        cout << "ccW" << endl;

    /*これは分けないと多分事故る*/
    else if (x == 0 && y ==0)
        cout << "mourennaihasimasenn" << endl;
    else if(z%gcd(x,y)==0){
        LL a,b,c,d,g,l,k;
        g=extgcd(x,y,a,b);
        l=lcm(x,y);
        //ax+by=g
 
        k=z/g;
        c=l/x;
        d=l/y;
        //(ak+nc)x+(bk-nd)y=g*k=z
        a*=k;b*=k;

        //nについて三分探索
        //のかわりにbtk法を使用
        auto f=[&](LL m){
            if(a+c*m<0&&b-d*m<0)return 1145141919ll;
            return abs(a+c*m)+abs(b-d*m);
        };
        LL n=0,w=114514,nx,ny;
        LL y=f(n);
        while(w>1){
            if ((ny=f(nx=x+w)) < y) y = ny, x = nx; 
            else if ((ny=f(nx=x-w)) < y) y = ny, x = nx;
            w =(w+1)/ 2;
        }
        LL res=n;
        for(int i=-3;i<=3;i++)if(f(res)>f(n+i))res=i;
        if(f(res)*2-1<=SZ){
            a=a+c*res;
            b=b-d*res;
            char s1='c',s2='w',e1='C',e2='C';
            if(a<=0){
                swap(s1,s2);
                swap(a,b);
            }
            if(a<0)e1='W';
            for(int i=0;i<b;i++)cout<<s2;
            for(int i=0;i<a;i++)cout<<s1;
            for(int i=0;i<b;i++)cout<<e2;
            for(int i=1;i<a;i++)cout<<e1;
            cout<<endl;
            return 0;
        }
    }
    
    cout << "mourennaihasimasenn" << endl;
    
    return 0;
}