{"raw_statement":[{"iden":"problem statement","content":"For a string $S$, let $f(S)$ be the lexicographically smallest cyclic shift of $S$. For example, if $S = $ `babca`, $f(S) = $ `ababc` because this is the smallest among all cyclic shifts (`babca`, `abcab`, `bcaba`, `cabab`, `ababc`).\nYou are given three integers $X, Y$, and $Z$. You want to construct a string $T$ that consists of exactly $X$ `a`s, exactly $Y$ `b`s, and exactly $Z$ `c`s. If there are multiple such strings, you want to choose one that maximizes $f(T)$ lexicographically.\nCompute the lexicographically largest possible value of $f(T)$."},{"iden":"constraints","content":"*   $1 \\leq X + Y + Z \\leq 50$\n*   $X, Y, Z$ are non-negative integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$X$ $Y$ $Z$"},{"iden":"sample input 1","content":"2 2 0"},{"iden":"sample output 1","content":"abab\n\n$T$ must consist of two `a`s and two `b`s.\n\n*   If $T = $ `aabb`, $f(T) = $ `aabb`.\n*   If $T = $ `abab`, $f(T) = $ `abab`.\n*   If $T = $ `abba`, $f(T) = $ `aabb`.\n*   If $T = $ `baab`, $f(T) = $ `aabb`.\n*   If $T = $ `baba`, $f(T) = $ `abab`.\n*   If $T = $ `bbaa`, $f(T) = $ `aabb`.\n\nThus, the largest possible $f(T)$ is `abab`."},{"iden":"sample input 2","content":"1 1 1"},{"iden":"sample output 2","content":"acb"}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}