{"raw_statement":[{"iden":"problem statement","content":"Among the strings of length $A + B$ containing $A$ occurrences of `a` and $B$ occurrences of `b`, find the string that comes $K$\\-th in the lexicographical order."},{"iden":"constraints","content":"*   $1 \\leq A, B \\leq 30$\n*   $1 \\leq K \\leq S$, where $S$ is the number of strings of length $A + B$ containing $A$ occurrences of `a` and $B$ occurrences of `b`.\n*   All values in input are integers."},{"iden":"input","content":"Input is given from Standard Input in the following format:\n\n$A$ $B$ $K$"},{"iden":"sample input 1","content":"2 2 4"},{"iden":"sample output 1","content":"baab\n\nHere are the strings containing two `a`s and two `b`s in the lexicographical order: `aabb`, `abab`, `abba`, `baab`, `baba`, and `bbaa`. The fourth string, `baab`, should be printed."},{"iden":"sample input 2","content":"30 30 118264581564861424"},{"iden":"sample output 2","content":"bbbbbbbbbbbbbbbbbbbbbbbbbbbbbbaaaaaaaaaaaaaaaaaaaaaaaaaaaaaa\n\n$K$ may not fit into a $32$\\-bit integer type."}],"translated_statement":null,"sample_group":[],"show_order":["default"],"formal_statement":null,"simple_statement":null,"has_page_source":true}