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

import java.io.BufferedReader;
import java.util.Scanner;
import java.io.IOException;
import java.io.InputStreamReader;
import java.util.StringTokenizer;
import java.io.PrintWriter;
import java.util.ArrayList;
import java.util.Comparator;


public class round494B {
	int INF = (int) 1e9;
	int MOD = 1000000007;

	void solve(InputReader in, PrintWriter out) throws IOException {
		int a = in.nextInt();
		int b = in.nextInt();
		int x = in.nextInt();
		char arr[] = new char[a+b];
		int i=0;
		int n = a+b;
		char max;
		char min;
		if(a>b){
			max = '0';
			min = '1';
		}
		else{
			max='1';
			min='0';
		}
		int cntmax=0;
		int cntmin=0;
		boolean f=false;
		while(x-->0){
			if(f){
				arr[i]=min;
				f=false;
				cntmin++;
			}
			else{
				arr[i]=max;
				f=true;
				cntmax++;
			}
			i++;
		}
		if(arr[i-1]==max){
			while(cntmax++<Math.max(a, b)){
				arr[i]=max;
				i++;
			}
			while(i<n){
				arr[i]=min;
				i++;
			}
		}
		else{
			while(cntmin++<Math.min(a, b)){
				arr[i] = min;
				i++;
			}
			while(i<n){
				arr[i]=max;
				i++;
			}
		}
		for(int i1=0;i1<n;i1++){
			System.out.print(arr[i1]);
		}
	}

	public static void main(String[] args) throws IOException {
		InputReader in = new InputReader();
		PrintWriter out = new PrintWriter(System.out);
		int t = 1;//in.nextInt();
		while (t-- > 0) {
			new round494B().solve(in, out);
		}
		out.close();
	}

	static class InputReader {
		static BufferedReader br;
		static StringTokenizer st;

		public InputReader() {
			br = new BufferedReader(new InputStreamReader(System.in));
		}

		String next() {
			while (st == null || !st.hasMoreTokens()) {
				try {
					st = new StringTokenizer(br.readLine());
				} catch (IOException e) {
					e.printStackTrace();
				}
			}
			return st.nextToken();
		}

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

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

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