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.util.*;

public class B implements Runnable{
	public static void main (String[] args) {new Thread(null, new B(), "_cf", 1 << 28).start();}

	public void run() {
		FastScanner fs = new FastScanner();
		PrintWriter out = new PrintWriter(System.out);
		System.err.println("Print");

		int a = fs.nextInt(), b = fs.nextInt(), x = fs.nextInt();
		if(x == 1) {
			for(int i = 0; i < a; i++) System.out.print("0");
			for(int i = 0; i < b; i++) System.out.print("1");
			return;
		}
		
		char put = '0';
		String chk = "";
		char[] chs = {'0', '1'};
		int[] vs = {a, b};
		int[] cs = new int[2];
		for(int i = 0; i < x; i++) {
			if(put == '1') put = '0';
			else put = '1';
			cs[put-'0']++;
			chk += put;
		}
		for(int i = 0; i + cs[put-'0'] < vs[put-'0']; i++) chk += chs[put-'0'];
		if(put == '0') put = '1';
		else put = '0';
		for(int i = 0; i + cs[put-'0'] < vs[put-'0']; i++) chk += chs[put-'0'];
		if(chk(a, b, x, chk)) {
			System.out.println(chk);
			return;
		}
		chk = "";
		put = '1';
		Arrays.fill(cs, 0);
		for(int i = 0; i < x; i++) {
			if(put == '1') put = '0';
			else put = '1';
			cs[put-'0']++;
			chk += put;
		}
		for(int i = 0; i + cs[put-'0'] < vs[put-'0']; i++) chk += chs[put-'0'];
		if(put == '0') put = '1';
		else put = '0';
		for(int i = 0; i + cs[put-'0'] < vs[put-'0']; i++) chk += chs[put-'0'];
		if(chk(a, b, x, chk)) {
			System.out.println(chk);
			return;
		}
		throw new RuntimeException();
		
//		out.close();
	}
	
	boolean chk(int a, int b, int x, String res) {
		int[] freq = new int[2];
		int d = 0;
		for(int i = 0; i < res.length(); i++) {
			if(i + 1 < res.length() && res.charAt(i) != res.charAt(i+1)) d++;
			freq[res.charAt(i)-'0']++;
		}
		return freq[0] == a && freq[1] == b && res.length() == a + b && d == x; 
	}
	
	void sort (int[] a) {
		int n = a.length;
		for(int i = 0; i < 50; i++) {
			Random r = new Random();
			int x = r.nextInt(n), y = r.nextInt(n);
			int temp = a[x];
			a[x] = a[y];
			a[y] = temp;
		}
		Arrays.sort(a);
	}

	class FastScanner {
		public int BS = 1<<16;
		public char NC = (char)0;
		byte[] buf = new byte[BS];
		int bId = 0, size = 0;
		char c = NC;
		double num = 1;
		BufferedInputStream in;

		public FastScanner() {
			in = new BufferedInputStream(System.in, BS);
		}

		public FastScanner(String s) throws FileNotFoundException {
			in = new BufferedInputStream(new FileInputStream(new File(s)), BS);
		}

		public char nextChar(){
			while(bId==size) {
				try {
					size = in.read(buf);
				}catch(Exception e) {
					return NC;
				}                
				if(size==-1)return NC;
				bId=0;
			}
			return (char)buf[bId++];
		}

		public int nextInt() {
			return (int)nextLong();
		}

		public long nextLong() {
			num=1;
			boolean neg = false;
			if(c==NC)c=nextChar();
			for(;(c<'0' || c>'9'); c = nextChar()) {
				if(c=='-')neg=true;
			}
			long res = 0;
			for(; c>='0' && c <='9'; c=nextChar()) {
				res = (res<<3)+(res<<1)+c-'0';
				num*=10;
			}
			return neg?-res:res;
		}

		public double nextDouble() {
			double cur = nextLong();
			return c!='.' ? cur:cur+nextLong()/num;
		}

		public String next() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c>32) {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public String nextLine() {
			StringBuilder res = new StringBuilder();
			while(c<=32)c=nextChar();
			while(c!='\n') {
				res.append(c);
				c=nextChar();
			}
			return res.toString();
		}

		public boolean hasNext() {
			if(c>32)return true;
			while(true) {
				c=nextChar();
				if(c==NC)return false;
				else if(c>32)return true;
			}
		}
		
		public int[] nextIntArray(int n) {
			int[] res = new int[n];
			for(int i = 0; i < n; i++) res[i] = nextInt();
			return res;
		}
		
	}

}