import std.conv, std.functional, std.stdio, std.string; import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons; import core.bitop; class EOFException : Throwable { this() { super("EOF"); } } string[] tokens; string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; } int readInt() { return readToken.to!int; } long readLong() { return readToken.to!long; } real readReal() { return readToken.to!real; } bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } } bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } } int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; } int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); } int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); } enum M = 5000; long X, Y, Z; void main() { try { for (; ; ) { X = readLong(); Y = readLong(); Z = readLong(); string ans = "NO"; if (Z == 0) { ans = "ccW"; goto done; } foreach (a; 0 .. M + 1) foreach (b; 0 .. M + 1) { if (a + b <= M && a * X + b * Y == Z) { ans = ""; foreach (_; 0 .. a) ans ~= "c"; foreach (_; 0 .. b) ans ~= "w"; foreach (_; 0 .. a + b - 1) ans ~= "C"; goto done; } } foreach (a; 0 .. M + 1) foreach (b; 0 .. M + 1) { if (a + b <= M && a * X - b * Y == Z) { ans = ""; foreach (_; 0 .. b) ans ~= "w"; foreach (_; 0 .. a) ans ~= "c"; foreach (_; 0 .. a - 1) ans ~= "C"; foreach (_; 0 .. b) ans ~= "W"; goto done; } } foreach (a; 0 .. M + 1) foreach (b; 0 .. M + 1) { if (a + b <= M && -a * X + b * Y == Z) { ans = ""; foreach (_; 0 .. a) ans ~= "c"; foreach (_; 0 .. b) ans ~= "w"; foreach (_; 0 .. b - 1) ans ~= "C"; foreach (_; 0 .. a) ans ~= "W"; goto done; } } done: writeln(ans); } } catch (EOFException e) { } }