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.OutputStream;
import java.io.IOException;
import java.io.InputStream;
import java.io.PrintWriter;
import java.io.FilterInputStream;
import java.io.BufferedInputStream;
import java.io.InputStream;

/**
 * @author khokharnikunj8
 */
public class Main {
    public static void main(String[] args) {
        new Thread(null, new Runnable() {
            public void run() {
                new Main().solve();
            }
        }, "1", 1 << 26).start();
    }

    void solve() {
        InputStream inputStream = System.in;
        OutputStream outputStream = System.out;
        ScanReader in = new ScanReader(inputStream);
        PrintWriter out = new PrintWriter(outputStream);
        BBinaryStringConstructing solver = new BBinaryStringConstructing();
        solver.solve(1, in, out);
        out.close();
    }

    static class BBinaryStringConstructing {
        public void solve(int testNumber, ScanReader in, PrintWriter out) {
            int a = in.scanInt();
            int b = in.scanInt();
            int x = in.scanInt();
            StringBuilder sb = new StringBuilder();
            if (a > b) {
                sb.append("0");
                int tt = 1;
                for (int i = 0; i < x; i++, tt ^= 1) sb.append(tt);
                for (int i = 0; i < sb.length(); i++) {
                    if (sb.charAt(i) == '0') a--;
                    else b--;
                }
                while (a-- > 0) sb.insert(0, '0');
                if (sb.charAt(sb.length() - 1) == '1') {
                    while (b-- > 0) sb.append('1');
                } else {
                    while (b-- > 0) sb.insert(sb.length() - 2, '1');
                }
                out.println(sb);
            } else {
                sb.append("1");
                int tt = 0;
                for (int i = 0; i < x; i++, tt ^= 1) sb.append(tt);
                for (int i = 0; i < sb.length(); i++) {
                    if (sb.charAt(i) == '0') a--;
                    else b--;
                }
                while (b-- > 0) sb.insert(0, '1');
                if (sb.charAt(sb.length() - 1) == '0') {
                    while (a-- > 0) sb.append('0');
                } else {
                    while (a-- > 0) sb.insert(sb.length() - 2, '0');
                }
                out.println(sb);
            }


        }

    }

    static class ScanReader {
        private byte[] buf = new byte[4 * 1024];
        private int index;
        private BufferedInputStream in;
        private int total;

        public ScanReader(InputStream inputStream) {
            in = new BufferedInputStream(inputStream);
        }

        private int scan() {
            if (index >= total) {
                index = 0;
                try {
                    total = in.read(buf);
                } catch (Exception e) {
                    e.printStackTrace();
                }
                if (total <= 0) return -1;
            }
            return buf[index++];
        }

        public int scanInt() {
            int integer = 0;
            int n = scan();
            while (isWhiteSpace(n)) n = scan();
            int neg = 1;
            if (n == '-') {
                neg = -1;
                n = scan();
            }
            while (!isWhiteSpace(n)) {
                if (n >= '0' && n <= '9') {
                    integer *= 10;
                    integer += n - '0';
                    n = scan();
                }
            }
            return neg * integer;
        }

        private boolean isWhiteSpace(int n) {
            if (n == ' ' || n == '\n' || n == '\r' || n == '\t' || n == -1) return true;
            else return false;
        }

    }
}

