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.*;
import java.util.StringTokenizer;


public class Main {

    public static void main(String[] args)throws IOException {
        Reader.init(System.in);
        int a = Reader.nextInt();
        int b = Reader.nextInt();
        int x = Reader.nextInt();
        int y = x;
        int a1 = a;
        int b1 = b;
        String s = "";
        String one = "1";
        String zero = "0";
        if (b>a) {
            s = s + one;
            b--;
            int count = 0;
            while (x > 0) {
                if (count % 2 == 0) {
                    s = s + zero;
                    a--;
                } else {
                    s = s + one;
                    b--;
                }
                count++;
                x--;
            }
        }
        else{
            s = s + zero;
            a--;
            int count = 0;
            while (x > 0) {
                if (count % 2 == 1) {
                    s = s + zero;
                    a--;
                } else {
                    s = s + one;
                    b--;
                }
                count++;
                x--;
            }
        }
        String remaning_one = "";
        String remaning_zero = "";
        while (a-->0){
            remaning_zero+=zero;
        }
        while (b-->0){
            remaning_one+=one;
        }
        if (a1>=b1){
            s = remaning_zero + s;
            if (y%2==0){
                s = s.substring(0,s.length()-1);
                s = s + remaning_one;
                s = s + zero;
            }
            else{
                s = s+remaning_one;
            }
        }
        else{
            s = remaning_one + s;
            if (y%2==0){
                s = s.substring(0,s.length()-1);
                s = s+ remaning_zero;
                s = s + one;
            }
            else{
                s = s+remaning_zero;
            }
        }
        System.out.println(s);




    }

    static void Q42(String[] arr1 , long[] arr2){
        Mergesort ob = new Mergesort();
        ob.sort(arr2,arr2.length,arr1);
        for (int i = 0 ; i < arr2.length;i++){
            System.out.print(arr1[i] + " ");
        }
        System.out.println();
    }
}

class Mergesort{
    public  long[] A;
    public  long[] aux;
    public  String[] aux1;
    public  int n;
    public String[] arr;
    public  long[] index;
    public  void sort(long[] A, int n,String[] arr){
        this.A = A;
        this.aux = new long[n];
        this.index = new long[n];
        this.aux1 = new String[n];
        this.arr = arr;
        this.n = n;
        mergesort(0,n-1);
    }
    public void mergesort(int low,int high){
        if (low<high) {
            int middle = (low + high)/2;
            mergesort(low,middle);
            mergesort(middle+1,high);
            merge(low,middle,high);
        }
    }
    public  void merge(int low,int middle, int high){
        for (int i = low;i<=high ;i++ ) {
            aux[i]= A[i];
            aux[i] = A[i];
            aux1[i] = arr[i];
        }
        int i = low;
        int j = middle + 1;
        int k = low;
        while(i<=middle && j<=high){
            if (aux[i]<=aux[j]) {
                A[k] = aux[i];
                A[k] = aux[i];
                arr[k] = aux1[i];
                i++;
            }
            else{
                A[k] = aux[j];
                A[k]=aux[j];
                arr[k] = aux1[j];
                j++;
            }
            k++;
        }
        while(i<=middle){
            A[k] = aux[i];
            A[k] = aux[i];
            arr[k] = aux1[i];
            k++;
            i++;
        }
        while(j<=high){
            A[k] = aux[j];
            A[k] = aux[j];
            arr[k] = aux1[j];
            k++;
            j++;
        }
    }
}
class Reader {
    static BufferedReader reader;
    static StringTokenizer tokenizer;

    /** call this method to initialize reader for InputStream */
    static void init(InputStream input) {
        reader = new BufferedReader(
                new InputStreamReader(input) );
        tokenizer = new StringTokenizer("");
    }

    /** get next word */
    static String next() throws IOException {
        while ( ! tokenizer.hasMoreTokens() ) {
            ///TODO add check for eof if necessary
            tokenizer = new StringTokenizer(
                    reader.readLine() );
        }
        return tokenizer.nextToken();
    }

    static int nextInt() throws IOException {
        return Integer.parseInt( next() );
    }

    static double nextDouble() throws IOException {
        return Double.parseDouble( next() );
    }
    static long nextLong() throws IOException {
        return Long.parseLong( next() );
    }
}

