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 math_codet;

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

public class lets_do {
    InputReader in;
    PrintWriter out;
    Helper_class h;
    final long mod=1000000007;
    public static void main(String[] args) throws java.lang.Exception{
        new lets_do().run();
    }
    void run() throws Exception{
        in=new InputReader();
        out = new PrintWriter(System.out);
        h = new Helper_class();
        int t=1;
        while(t-->0)
            solve();
        out.flush();    
        out.close();
    }
    long[] arr;
    int n;
    HashMap<Integer,Integer> hmap=new HashMap<Integer,Integer>();
    HashSet<Integer> hset=new HashSet<Integer>();
    void solve(){
        int a=h.ni();
        int b=h.ni();
        int x=h.ni();
        int i=0;
        if(x%2!=0){
            int reqd=(x+1)/2;
            String st="";
            for(i=0;i<reqd;i++)
                st+="01";
            a-=reqd;
            b-=reqd;
            String st1="";
            String st2="";
            for(i=0;i<a;i++)
                st1+="0";
            for(i=0;i<b;i++)
                st2+="1";
            String ans=st1+st+st2;
            h.pn(ans);
        }
        else{
            String st="";
            if(x==2) {
            	if(a>b) {
            		for(i=0;i<a/2;i++)
            			st+="0";
            		for(i=0;i<b;i++)
            			st+="1";
            		for(i=0;i<a-a/2;i++)
            			st+="0";
            	}
            	else {
            		for(i=0;i<b/2;i++)
            			st+="1";
            		for(i=0;i<a;i++)
            			st+="0";
            		for(i=0;i<b-b/2;i++)
            			st+="1";
            	}
                
            }
            else {
            	
            
            if(b>a){
                int reqd=x/2;
                String st1="";
                String st2="";
                for(i=0;i<reqd;i++)
                    st+="10";
                a=a-reqd;
                for(i=0;i<a;i++)
                    st+="0";
                b=b-reqd;
                for(i=0;i<b;i++)
                    st+="1";
            }
            else if(a>b){
                int reqd=x/2;
                String st1="";
                String st2="";
                for(i=0;i<reqd;i++)
                    st+="01";
                b=b-reqd;
                for(i=0;i<b;i++)
                    st+="1";
                a=a-reqd;
                for(i=0;i<a;i++)
                    st+="0";
            }
            else{
                int reqd=x/2;
                //String st="";
                String st1="";
                String st2="";
                for(i=0;i<reqd;i++)
                    st+="01";
                b=b-reqd;
                a=a-reqd;
                for(i=0;i<b;i++)
                    st1+="1";
                for(i=0;i<a;i++)
                    st2+="0";
                st+=st1+st2;
            
            }
            }
            h.pn(st+"");
        }
    }

    class Helper_class{
        long gcd(long a, long b){return (b==0)?a:gcd(b,a%b);}
        int gcd(int a, int b){return (b==0)?a:gcd(b,a%b);}
        int bitcount(long n){return (n==0)?0:(1+bitcount(n&(n-1)));}
        void p(Object o){out.print(o);}
        void pn(Object o){out.println(o);}
        void pni(Object o){out.println(o);out.flush();}
        String n(){return in.next();}
        String nln(){return in.nextLine();}
        int ni(){return Integer.parseInt(in.next());}
        long nl(){return Long.parseLong(in.next());}
        double nd(){return Double.parseDouble(in.next());}

        long mul(long a,long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            a*=b;
            if(a>=mod)a%=mod;
            return a;
        }
        long modPow(long a, long p){
            long o = 1;
            while(p>0){
                if((p&1)==1)o = mul(o,a);
                a = mul(a,a);
                p>>=1;
            }
            return o;
        }
        long add(long a, long b){
            if(a>=mod)a%=mod;
            if(b>=mod)b%=mod;
            if(b<0)b+=mod;
            a+=b;
            if(a>=mod)a-=mod;
            return a;
        }
    }

    class InputReader{
        BufferedReader br;
        StringTokenizer st;
        public InputReader(){
            br = new BufferedReader(new InputStreamReader(System.in));
        }
 
        public InputReader(String s) throws Exception{
            br = new BufferedReader(new FileReader(s));
        }
 
        String next(){
            while (st == null || !st.hasMoreElements()){
                try{
                    st = new StringTokenizer(br.readLine());
                }catch (IOException  e){
                    e.printStackTrace();
                }
            }
            return st.nextToken();
        }
 
        String nextLine(){
            String str = "";
            try{
                str = br.readLine();
            }catch (IOException e){
                e.printStackTrace();
            }   
            return str;
        }
    }
}       