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. 
//package JCFULY3;

import java.io.*;
import java.util.*;

public class Q2 {

    static class InputReader {
        public BufferedReader reader;
        public StringTokenizer tokenizer;

        public InputReader() {
            reader = new BufferedReader(new InputStreamReader(System.in), 32768);
            tokenizer = null;
        }

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

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

        public char nextChar() {
            return next().charAt(0);
        }

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

        public long nextLong() {
            return Long.parseLong(next());
        }

        public double nextDouble() {
            return Double.parseDouble(next());
        }

        public int[] nextIntArr(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextInt();
            }
            return arr;
        }

        public Integer[] nextIntegerArr(int n) {
            Integer[] arr = new Integer[n];
            for (int i = 0; i < n; i++) {
                arr[i] = new Integer(this.nextInt());
            }
            return arr;
        }

        public int[][] next2DIntArr(int n, int m) {
            int[][] arr = new int[n][m];
            for (int i = 0; i < n; i++) {
                for (int j = 0; j < m; j++) {
                    arr[i][j] = this.nextInt();
                }
            }
            return arr;
        }

        public int[] nextSortedIntArr(int n) {
            int[] arr = new int[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextInt();
            }
            Arrays.sort(arr);
            return arr;
        }

        public long[] nextLongArr(int n) {
            long[] arr = new long[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextLong();
            }
            return arr;
        }

        public char[] nextCharArr(int n) {
            char[] arr = new char[n];
            for (int i = 0; i < n; i++) {
                arr[i] = this.nextChar();
            }
            return arr;
        }
    }

    public static void main(String[] args) {

        InputReader in = new InputReader();
        int a = in.nextInt();
        int b = in.nextInt();
        int x = in.nextInt();

        //   int input[] = new int[a + b + 1];

//       ;
//    System.out.print(input[i]);
//            return;
//        }
//        if (x == 0) {
//            for (int i = 1; i <= a + b; i++)
//
////        for (int i = 1; i <= a + b; i++) {
////            if (i <= a)
//                input[i] = 0;
//            else
//                input[i] = 1;
//        }
//        x--


//        int prv = -1;
//
//        while (x > 0) {
//
//            if(x==1){
//                if(prv==1){
//                    int i=0;
//                    while(i<b){
//                        System.out.print(1);
//                        i++;
//                    }

//                    i=0;
//                    while(i<a){
//                        System.out.print(0);
//                        i++;
//                    }
//                    return;
//                }else{
//                    int i=0;
//                    while(i<a){
//                        System.out.print(0);
//                        i++;
//                    }
//                    i=0;
//                    while(i<b){
//                        System.out.print(1);
//                        i++;
//                    }
//                    return;
//                }
//            }
//


        String out = "";


        if (a > b) {
            out+= 0;
            a--;
        } else {
            out+= 1;
            b--;
        }
        System.out.println(string(a, b, x, out, 0));
    }

    static String string(int a, int b, int x, String output, int index) {
        if (a == 0 && b == 0)
            return output;

        char last = output.charAt(index);
        int num = last - '0';
        if (x == 1) {
            if (num == 0) {
                for (int i = 0; i < a; i++)
                    output = output + 0;

                for (int i = 0; i < b; i++)
                    output = output + 1;

            } else if (num == 1) {
                for (int i = 0; i < b; i++)
                    output = output + 1;

                for (int i = 0; i < a; i++)
                    output = output + 0;
            }
            a = 0;
            b = 0;
        } else if (x > 1) {
            if (num == 0) {
                if (b != 0) {
                    output = output + 1;
                    b--;
                }
            } else {
                if (a != 0) {
                    output = output + 0;
                    a--;
                }
            }
            index++;
        }
         return string(a, b, x - 1, output, index);

    }
}