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.math.*;
import java.text.*;
import java.util.*;
import java.util.regex.*;
 
public class Solution 
{
    static class InputReader
	{
	    private final InputStream stream;
	    private final byte[] buf = new byte[8192];
	    private int curChar, snumChars;
 
	    public InputReader(InputStream st) {
	      this.stream = st;
	    }
 
	    public int read() {
	      if (snumChars == -1)
	        throw new InputMismatchException();
	      if (curChar >= snumChars) {
	        curChar = 0;
	        try {
	          snumChars = stream.read(buf);
	        } catch (IOException e) {
	          throw new InputMismatchException();
	        }
	        if (snumChars <= 0)
	          return -1;
	      }
	      return buf[curChar++];
	    }
 
	    public int nextInt() {
	      int c = read();
	      while (isSpaceChar(c)) {
	        c = read();
	      }
	      int sgn = 1;
	      if (c == '-') {
	        sgn = -1;
	        c = read();
	      }
	      int res = 0;
	      do {
	        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 {
	        res *= 10;
	        res += c - '0';
	        c = read();
	      } while (!isSpaceChar(c));
	      return res * sgn;
	    }
 
	    public int[] nextIntArray(int n) {
	      int a[] = new int[n];
	      for (int i = 0; i < n; i++) {
	        a[i] = nextInt();
	      }
	      return a;
	    }
 
	    public String readString() {
	      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 isSpaceChar(int c) {
	      return c == ' ' || c == '\n' || c == '\r' || c == '\t' || c == -1;
	    }
 
	    private boolean isEndOfLine(int c) {
	      return c == '\n' || c == '\r' || c == -1;
	    }
	}
    public static void main(String[] args) throws IOException 
    {
        InputReader in=new InputReader(System.in);
        int a=in.nextInt();//zero
        int b=in.nextInt();
        int x=in.nextInt();
        int n=a+b;
        int segs=x+1;
        StringBuilder sb=new StringBuilder();
        int n0=0,n1=0;
        int prev=-1;
        if(segs%2==1)
        {
            if(a>b)
            {
                n0=(segs/2)+1;
                n1=(segs/2);
                prev=1;
            }
            else
            {
                n0=(segs/2);
                n1=(segs/2)+1;
                prev=0;
            }
        }
        else
        {
            prev=1;
            n0=(segs/2);
            n1=(segs/2);
        }
        while(segs>0)
        {
            if(prev==0 && n1>0)
            {
                sb.append('1');
                n1--;
                b--;
                prev=1;
            }
            else if(n0>0)
            {
                sb.append('0');
                n0--;
                a--;
                prev=0;
            }
            segs--;
        }
        int m=sb.length();
        int i=0;
        while(a>0 || b>0)
        {
            if(sb.charAt(i)=='0' && a>0)
            {
                while(a>0)
                {
                    sb.insert(i,'0');
                    a--;
                }
            }
            else if(sb.charAt(i)=='1' && b>0)
            {
                while(b>0)
                {
                    sb.insert(i,'1');
                    b--;
                }
            }
            i++;
        }
        System.out.println(sb.toString());
    }
}
