import sys # input = sys.stdin.readline #input = sys.stdin.buffer.readline #文字列はダメ #sys.setrecursionlimit(1000000) import math import bisect #import itertools #import random #from heapq import heapify, heappop, heappush from collections import defaultdict from collections import deque import copy #DeepCopy: hoge = [_[:] for _ in hogehoge] #from functools import lru_cache #@lru_cache(maxsize=None) #MOD = pow(10,9) + 7 # MOD = 998244353 dx = [1,0,-1,0] dy = [0,1,0,-1] #dx8 = [1,1,0,-1,-1,-1,0,1] #dy8 = [0,1,1,1,0,-1,-1,-1] def main(): N,M,K = map(int,input().split()) if N == M: mx = N+M-1 else: mx = min(N,M) * 2 if mx < K: print(-1) exit() block0 = [[] for _ in range(K+1)] # 0 start N0 = N; M0 = M zero = True for i in range(K+1): if i%2 == 0: if N0 > 0: block0[i].append('0') N0 -= 1 else: zero = False break else: if M0 > 0: block0[i].append('1') M0 -= 1 else: zero = False break if zero: for _ in range(N0): block0[0].append('0') if (K+1)%2 == 0: #最後が1 for _ in range(M0): block0[-1].append('1') else: if (K+1)%2 == 1 and K+1 >= 2: for _ in range(M0): block0[-2].append('1') block0 = ["".join(block0[i]) for i in range(K+1)] z = "".join(block0) N1 = N; M1 = M one = True block1 = [[] for _ in range(K+1)] for i in range(K+1): if i%2 == 0: if M1 > 0: block1[i].append('1') M1 -= 1 else: one = False break else: if N1 > 0: block1[i].append('0') N1 -= 1 else: one = False break if one: if K+1 >= 2: for _ in range(N1): block1[1].append('0') if (K+1)%2 == 1: for _ in range(M1): block1[-1].append('1') elif K+1 >= 2: for _ in range(M1): block1[-2].append('1') block1 = ["".join(block1[i]) for i in range(K+1)] o = "".join(block1) if zero and one: print(min(z,o)) elif zero: print(z) elif one: print(o) else: print(-1) if __name__ == '__main__': main()