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.BufferedReader;
import java.io.IOException;
import java.io.InputStreamReader;
import java.io.PrintWriter;
import java.util.StringTokenizer;

public class olymp {
    static BufferedReader br;
    static StringTokenizer st = new StringTokenizer("");

    public static int nextInt() throws IOException {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return Integer.parseInt(st.nextToken());
    }

    public static String next() throws IOException {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return st.nextToken();
    }

    public static long nextLong() throws IOException {
        if (!st.hasMoreTokens()) {
            st = new StringTokenizer(br.readLine());
        }
        return Long.parseLong(st.nextToken());
    }

    public static void main(String[] args) throws IOException {
        br = new BufferedReader(new InputStreamReader(System.in));
        PrintWriter pw = new PrintWriter(System.out);
        int b = nextInt();
        int a = nextInt();
        int c = nextInt();
        int a1=a;
        int b1=b;
        if (c == 1) {
            for (int i = 0; i < a; i++) {
                pw.print(1);
            }
            for (int i = 0; i < b; i++) {
                pw.print(0);
            }
            pw.close();
            return;
        }
        if (a < b) {
            int r = a;
            a = b;
            b = r;
        }
        if (c % 2 == 0) {
            int[] d = new int[a + b];
            for (int i = 0; i < a - 1; i++) {
                d[i] = 1;
            }
            d[a + b - 1] = 1;
            int u = 2;
            int pr = a + b - 1;
            int l = a - 1;
            while (u != c) {
                pr -= 2;
                l--;
                d[pr] = 1;
                d[l] = 0;
                u += 2;
            }
            for (int i = 0; i < d.length; i++) {
                if(a1<b1){
                    if(d[i]==1){
                        d[i]=0;
                    }
                    else {
                        d[i]=1;
                    }
                }
                pw.print(d[i]);
            }
        } else {
            int[] d = new int[a + b];
            for (int i = 1; i < a; i++) {
                d[i] = 1;
            }
            d[a + b - 1] = 1;
            int u = 3;
            int pr = a + b - 1;
            int l = a;
            while (u != c) {
                pr -= 2;
                l--;
                d[pr] = 1;
                d[l] = 0;
                u += 2;
            }
            for (int i = 0; i < d.length; i++) {
                if(a1<b1){
                    if(d[i]==1){
                        d[i]=0;
                    }
                    else {
                        d[i]=1;
                    }
                }
                pw.print(d[i]);
            }
        }
        pw.close();
    }
}