#include <iostream>
#include <iomanip>
#include <sstream>
#include <vector>
#include <string>
#include <set>
#include <unordered_set>
#include <map>
#include <unordered_map>
#include <stack>
#include <queue>
#include <deque>
#include <algorithm>
#include <functional>
#include <iterator>
#include <limits>
#include <numeric>
#include <utility>
#include <type_traits>
#include <cmath>
#include <cassert>
#include <cstdio>

using namespace std;
using namespace placeholders;

using LL = long long;
using ULL = unsigned long long;
using VI = vector< int >;
using VVI = vector< vector< int > >;
using VS = vector< string >;
using ISS = istringstream;
using OSS = ostringstream;
using PII = pair< int, int >;
using VPII = vector< pair< int, int > >;
template < typename T = int > using VT = vector< T >;
template < typename T = int > using VVT = vector< vector< T > >;
template < typename T = int > using LIM = numeric_limits< T >;

template < typename T > inline istream& operator>>( istream &s, vector< T > &v ){ for ( T &t : v ) { s >> t; } return s; }
template < typename T > inline ostream& operator<<( ostream &s, const vector< T > &v ){ for ( int i = 0; i < int( v.size() ); ++i ){ s << ( " " + !i ) << v[i]; } return s; }
template < typename T > inline T fromString( const string &s ) { T res; istringstream iss( s ); iss >> res; return res; }
template < typename T > inline string toString( const T &a ) { ostringstream oss; oss << a; return oss.str(); }

#define NUMBERED( name, number ) NUMBERED2( name, number )
#define NUMBERED2( name, number ) name ## _ ## number
#define REP1( n ) REP2( NUMBERED( REP_COUNTER, __LINE__ ), n )
#define REP2( i, n ) REP3( i, 0, n )
#define REP3( i, m, n ) for ( int i = ( int )( m ); i < ( int )( n ); ++i )
#define GET_REP( a, b, c, F, ... ) F
#define REP( ... ) GET_REP( __VA_ARGS__, REP3, REP2, REP1 )( __VA_ARGS__ )
#define FOR( e, c ) for ( auto &&e : c )
#define ALL( c ) begin( c ), end( c )
#define AALL( a ) ( remove_all_extents< decltype( a ) >::type * )a, ( remove_all_extents< decltype( a ) >::type * )a + sizeof( a ) / sizeof( remove_all_extents< decltype( a ) >::type )
#define DRANGE( c, p ) begin( c ), begin( c ) + ( p ), end( c )

#define SZ( v ) ( (int)( v ).size() )
#define EXIST( c, e ) ( ( c ).find( e ) != ( c ).end() )

template < typename T > inline bool chmin( T &a, const T &b ){ if ( b < a ) { a = b; return true; } return false; }
template < typename T > inline bool chmax( T &a, const T &b ){ if ( a < b ) { a = b; return true; } return false; }

#define PB push_back
#define EM emplace
#define EB emplace_back
#define BI back_inserter

#define MP make_pair
#define fst first
#define snd second

#define DUMP( x ) cerr << #x << " = " << ( x ) << endl

constexpr int MAX_L = 10000;

int main()
{
	cin.tie( 0 );
	ios::sync_with_stdio( false );
	cout << setprecision( 12 ) << fixed;

	LL X, Y, Z;
	cin >> X >> Y >> Z;

	if ( Z == 0 )
	{
		cout << "ccW" << endl;
		return 0;
	}
	else if ( Y == 0 )
	{
		if ( X == 0 || Z % X )
		{
			cout << "mourennaihasimasenn" << endl;
		}
		else
		{
			const string res = string( Z / X, 'c' ) + string( Z / X - 1, 'C' );
			if ( SZ( res ) <= MAX_L )
			{
				cout << res << endl;
			}
			else
			{
				cout << "mourennaihasimasenn" << endl;
			}
		}
		return 0;
	}

	REP( i, -MAX_L, MAX_L + 1 )
	{
		const LL rest = Z - i * X;
		if ( rest % Y )
		{
			continue;
		}

		const LL j = rest / Y;

		if ( MAX_L < abs( i ) + abs( j ) )
		{
			continue;
		}

		string res;
		if ( 0 <= i && 0 <= j )
		{
			res += string( i, 'c' );
			res += string( j, 'w' );
			res += string( i + j - 1, 'C' );
		}
		else
		{
			if ( i < 0 )
			{
				res += string( -i, 'c' );
				res += string( j, 'w' );
			}
			else
			{
				res += string( -j, 'w' );
				res += string( i, 'c' );
			}

			res += string( max< LL >( i, j ) - 1, 'C' );
			res += string( -min< LL >( i, j ), 'W' );
		}

		if ( !res.empty() && SZ( res ) <= MAX_L )
		{
			cout << res << endl;
			return 0;
		}
	}

	cout << "mourennaihasimasenn" << endl;

	return 0;
}