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.IOException;
import java.io.InputStream;
import java.util.Arrays;
import java.util.InputMismatchException;

public class B {
    public static void main(String args[])
    {
        FastReader Reader=new FastReader(System.in);
        int a=Reader.nextInt();
        int b=Reader.nextInt();
        int x=Reader.nextInt();
        int arr[]=new int[a+b];
        if(x%2!=0)
        {
            int val=(x+1)/2;
            for(int i=0;i<b-val;i++)
            {
                arr[i]=1;
            }
            for(int i=0;i<2*val;i++)
            {
                if(i%2==0)
                    arr[b-val+i]=1;
                else
                    arr[b-val+i]=0;
            }
            for(int i=0;i<a-val;i++)
            {
                arr[b+val+i]=0;
            }
        }
        else
        {
            if(a>b)
            {
                arr[0]=0;
                int val=x/2;

                for(int i=0;i<b-val+1;i++)
                {
                    arr[1+i]=1;
                }
                int count=val-1;
                for(int i=0;i<a+val-2;i++)
                {
                    if(i%2==0)
                        arr[i+b-val+2]=0;
                    else {
                        if(count>0) {
                            arr[i + b - val + 2] = 1;
                            count--;
                        }
                        else
                        {
                            arr[i+b-val+2]=0;
                        }
                    }
                }
            }

            else
            {
                arr[0]=1;
                int val=x/2;
                int count=val-1;
                for(int i=0;i<a-val+1;i++)
                {
                    arr[1+i]=0;
                }
                for(int i=0;i<b+val-2;i++)
                {
                    if(i%2==0)
                        arr[i+a-val+2]=1;
                    else {
                        if(count>0) {
                            arr[i + a - val + 2] = 0;
                            count--;
                        }
                        else
                        {
                            arr[i+a-val+2]=1;
                        }
                    }
                }
            }
        }
        for(int i=0;i<a+b;i++)
        {
            System.out.print(arr[i]);
        }
    }
    public static void sorts(int arr[],int N)
    {
        Integer arr_obj[]=new Integer[N];
        for(int i=0; i<N; ++i){
            arr_obj[i] = new Integer(arr[i]);
        }
        Arrays.sort(arr_obj);
        for(int i=0; i<N; ++i){
            arr[i] = arr_obj[i];
        }
    }
}
class FastReader {
    private InputStream stream;
    private byte[] buf = new byte[8192];
    private int curChar;
    private int pnumChars;
    private FastReader.SpaceCharFilter filter;

    public FastReader(InputStream stream) {
        this.stream = stream;
    }

    public int read() {
        if (pnumChars == -1) {
            throw new InputMismatchException();
        }
        if (curChar >= pnumChars) {
            curChar = 0;
            try {
                pnumChars = stream.read(buf);
            } catch (IOException e) {
                throw new InputMismatchException();
            }
            if (pnumChars <= 0) {
                return -1;
            }
        }
        return buf[curChar++];
    }

    public String next() {
        return nextString();
    }

    public int nextInt() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        int res = 0;
        do {
            if (c == ',') {
                c = read();
            }
            if (c < '0' || c > '9') {
                throw new InputMismatchException();
            }
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public long nextLong() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        int sgn = 1;
        if (c == '-') {
            sgn = -1;
            c = read();
        }
        long res = 0;
        do {
            if (c < '0' || c > '9')
                throw new InputMismatchException();
            res *= 10;
            res += c - '0';
            c = read();
        } while (!isSpaceChar(c));
        return res * sgn;
    }

    public String nextString() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isSpaceChar(c));
        return res.toString();
    }

    public String nextLine() {
        int c = read();
        while (isSpaceChar(c))
            c = read();
        StringBuilder res = new StringBuilder();
        do {
            res.appendCodePoint(c);
            c = read();
        } while (!isEndOfLine(c));
        return res.toString();
    }


    public boolean isEndOfLine(int c) {
        return c == '\n' || c == '\r' || c == -1;
    }

    public boolean isSpaceChar(int c) {
        if (filter != null) {
            return filter.isSpaceChar(c);
        }
        return isWhitespace(c);
    }

    public static boolean isWhitespace(int c) {
        return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
    }

    public interface SpaceCharFilter {
        public boolean isSpaceChar(int ch);

    }

}