#include "bits/stdc++.h" using namespace std; typedef long long ll; typedef pair<int,int> pii; #define rep(i,n) for(ll i=0;i<(ll)(n);i++) #define all(a) (a).begin(),(a).end() #define pb push_back #define INF (1LL<<59) string bio = "mourennaihasimasenn"; int f(int x){ if(x>0)return 2*x-1; else if(x==0)return 0; else return 2*abs(x)+3; } void g(char ch,int x){ if(x>0){ rep(i,x)cout<<ch; rep(i,x-1)cout<<'C'; }else if(x==0)return ; else{ rep(i,abs(x)+2)cout<<ch; rep(i,abs(x)+1)cout<<'W'; } } int main(){ int a,b,c; cin>>a>>b>>c; if(c%__gcd(a,b)!=0){ cout<<bio<<endl; return 0; } if(c==0){ cout<<endl; return 0; } else if(a==0&&b==0){ cout<<bio<<endl; return 0; } else if(a==0){ if(c%b==0){ int num = c/b; rep(i,num)cout<<'w'; rep(i,num-1)cout<<'C'; cout<<endl; } else cout<<bio<<endl; return 0; } else if(b==0){ if(c%a==0){ int num = c/a; rep(i,num)cout<<'c'; rep(i,num-1)cout<<'C'; cout<<endl; } else cout<<bio<<endl; return 0; } ll mini = INF; int yd,xd; int l = a/__gcd(a,b)*b; for(int x=-l;a*x<=c;x++){ int df = c-a*x; if(abs(df)%b!=0)continue; int y = df/b; int sum =f(x)+f(y); if(x&&y)sum++; if(mini>sum){ mini = sum; xd = x; yd = y; } } if(mini>100000)cout<<bio<<endl; else{ g('c',xd); g('w',yd); if(xd&&yd)cout<<'C'<<endl; else cout<<endl; } }