#include <bits/stdc++.h>
#define EPS 1e-9
#define INF 1070000000LL
#define MOD 1000000007LL
#define fir first
#define foreach(it,X) for(auto it=(X).begin();it!=(X).end();it++)
#define numa(x,a) for(auto x: a)
#define ite iterator
#define mp make_pair
#define rep(i,n) rep2(i,0,n)
#define rep2(i,m,n) for(int i=m;i<(n);i++)
#define pb push_back
#define pf push_front
#define sec second
#define sz(x) ((int)(x).size())
#define ALL( c ) (c).begin(), (c).end()
#define gcd(a,b) __gcd(a,b)
#define mem(x,n) memset(x,n,sizeof(x))
#define endl "\n"
using namespace std;
template <int POS, class TUPLE> void deploy(std::ostream &os, const TUPLE &tuple){}
template <int POS, class TUPLE, class H, class ...Ts> void deploy(std::ostream &os, const TUPLE &t){ os << (POS == 0 ? "" : ", ") << get<POS>(t); deploy<POS + 1, TUPLE, Ts...>(os, t); }
template <class T,class U> std::ostream& operator<<(std::ostream &os, std::pair<T,U> &p){ os << "(" << p.first <<", " << p.second <<")";return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::vector<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T> std::ostream& operator<<(std::ostream &os, std::set<T> &v){ int remain = v.size(); os << "{"; for(auto e: v) os << e << (--remain == 0 ? "}" : ", "); return os; }
template <class T, class K> std::ostream& operator<<(std::ostream &os, std::map<T, K> &mp){ int remain = mp.size(); os << "{"; for(auto e: mp) os << "(" << e.first << " -> " << e.second << ")" << (--remain == 0 ? "}" : ", "); return os; }
#define DEBUG1(var0) { std::cerr << (#var0) << "=" << (var0) << endl; }
#define DEBUG2(var0, var1) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG1(var1); }
#define DEBUG3(var0, var1, var2) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG2(var1,var2); }
#define DEBUG4(var0, var1, var2, var3) { std::cerr << (#var0) << "=" << (var0) << ", ";DEBUG3(var1,var2,var3); }
using ll = long long;


ll calczero(){
  return 3;
}
string makezero(){
  return "ccW";
}

ll calclen(ll a) {
  if (a == 0) {
    return 0;
  }
  if (a < 0) {
    return calczero() + abs(a) * 2;
  } else {
    return a + (a-1);
  }
}


int main()
{
  cin.tie(0);
  ios_base::sync_with_stdio(0);
  ll x,y;
  cin >> x >> y;
  ll a,b;
  ll z;
  cin >> z;
  ll AB = INF;
  for (ll a_ = -10000; a_ <= 10000; a_++) {
    if ((z - a_ * x) % y == 0) {
      ll nAB;
      if (y == 0) {
        nAB = abs(a);
      } else {
        nAB = abs(a_) + abs((z - a_ * x) / y);
      }
      if (AB >= nAB) {
        AB = nAB;
        a = a_;
        b = nAB - a_;
      }
    }
  }
  const string I = "mourennaihasimasenn";
  if (AB == INF) {
    cout << I << endl;
    return 0;
  }
  DEBUG2(a,b);
  char c = 'c', w = 'w', C = 'C', W = 'W';
  if (a < b) {
    swap(c,w);
    swap(a,b);
  }
  // a >= b 
  ll anslen = 0;
  if (a < 0) {
    anslen += calczero() + abs(a) * 2;
    // b < 0
    anslen += abs(b) * 2;
  } else if (a > 0) {
    anslen += a + a - 1;
    anslen += abs(b) * 2;
  } else {
    if (b < 0) {
      anslen += calczero() + abs(a) * 2;
    }else if (b > 0){
      anslen += b + b - 1;
    } else {
      anslen = calczero();
    }
  }
  if (anslen > 10000)  {
    cout << I << endl;
    return 0;
  }
  string ans;
  if (a < 0) {
    ans += makezero();
    rep(i,abs(a)) {
      ans += c;
      ans += W;
    }
    // b < 0
    rep(i,abs(b)) {
      ans += w;
      if (b < 0) {
        ans += W;
      }else{
        ans += C;
      }
    }
  } else if (a > 0) {
    ans += c;
    rep(i,a-1) {
      ans += c;
      ans += C;
    }
    if (b != 0) {
      rep(i,abs(b)) {
        ans += w;
        if (b < 0) {
          ans += W;
        } else {
          ans += C;
        }
      }
    }
  } else {
    if (b < 0) {
      ans += makezero();
      rep(i,abs(b)) {
        ans += w;
        ans += W;
      }
    }else if (b > 0){
      ans += w;
      rep(i,a-1) {
        ans += w;
        ans += C;
      }
    } else {
      ans = makezero();
    }
  }
  cout << ans << endl;
  assert(sz(ans) == anslen);
  return 0;
}