You are given three integers a, b and x. Your task is to construct a binary string s of length n = a + b such that there are exactly a zeroes, exactly b ones and exactly x indices i (where 1 ≤ i < n) such that s_i ≠ s_{i + 1}. It is guaranteed that the answer always exists.

For example, for the string "01010" there are four indices i such that 1 ≤ i < n and s_i ≠ s_{i + 1} (i = 1, 2, 3, 4). For the string "111001" there are two such indices i (i = 3, 5).

Recall that binary string is a non-empty sequence of characters where each character is either 0 or 1.

Input

The first line of the input contains three integers a, b and x (1 ≤ a, b ≤ 100, 1 ≤ x < a + b).

Output

Print only one string s, where s is any binary string satisfying conditions described above. It is guaranteed that the answer always exists.

Examples

Input

2 2 1


Output

1100


Input

3 3 3


Output

101100


Input

5 3 6


Output

01010100

Note

All possible answers for the first example: 

  * 1100; 
  * 0011. 



All possible answers for the second example: 

  * 110100; 
  * 101100; 
  * 110010; 
  * 100110; 
  * 011001; 
  * 001101; 
  * 010011; 
  * 001011. 
import java.io.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.util.StringTokenizer;
import java.io.IOException;
import java.io.BufferedReader;
import java.io.InputStreamReader;
import java.io.InputStream;

/**
 * Built using CHelper plug-in
 * Actual solution is at the top
 *
 * @author kessido
 */
public class Main {
    public static void main(String[] args) {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        InputReader in = new InputReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBinaryStringConstructing solver = new BBinaryStringConstructing();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBinaryStringConstructing {
        public void solve(int testNumber, InputReader in, PrintWriter out) {
            int a = in.NextInt();
            int b = in.NextInt();
            int x = in.NextInt();
            String res = "";
            int x_2 = x;
            if (x_2 % 2 == 0) {
                x_2 -= 1;
            }
            x = x - x_2;
            for (int i = 0; i < x_2; ) {
                res += "10";
                if (i == 0) i++;
                else i += 2;
                a--;
                b--;
            }
            if (x == 0) {
                for (int i = 0; i < a; i++) {
                    res += "0";
                }
                for (int i = 0; i < b; i++) {
                    res = "1" + res;
                }
            } else {
                if (b != 0) {
                    for (int i = 0; i < a; i++) {
                        res += "0";
                    }
                    for (int i = 0; i < b; i++) {
                        res += "1";
                    }
                } else {
                    for (int i = 0; i < a; i++) {
                        res = "0" + res;
                    }
                }
            }
            out.println(res);
        }

    }

    static class InputReader {
        BufferedReader reader;
        StringTokenizer tokenizer;

        public InputReader(InputStream stream) {
            reader = new BufferedReader(new InputStreamReader(stream), 32768);
            tokenizer = null;
        }

        public String next() {
            while (tokenizer == null || !tokenizer.hasMoreTokens()) {
                try {
                    tokenizer = new StringTokenizer(reader.readLine(), " \t\n\r\f,");
                } catch (IOException e) {
                    throw new RuntimeException(e);
                }
            }
            return tokenizer.nextToken();
        }

        public int NextInt() {
            return Integer.parseInt(next());
        }

    }
}

