#include <iostream>
#include <string>
#include <vector>
#include <algorithm>
#include <atcoder/modint>
using namespace std;
using i32 = int;
using u32 = unsigned int;
using i64 = long long;
using u64 = unsigned long long;
#define rep(i,n) for(int i=0; i<(int)(n); i++)
const i64 INF = 1001001001001001001;

using Modint = atcoder::static_modint<998244353>;

int main(){
    int N, M, K; cin >> N >> M >> K;
    if(K > min(N,M)*2){ cout << "-1\n"; return 0; }
    if(K >= N+M){ cout << "-1\n"; return 0; }
    if(K == 0){
        if(N > 0 && M > 0){ cout << "-1\n"; return 0; }
        rep(i,N) cout << "0";
        rep(i,M) cout << "1";
        cout << '\n';
        return 0;
    }
    if(N == M){
        if(K == N*2-1){
            rep(i,N) cout << "01";
            cout << '\n';
            return 0;
        }
    }
    if(N*2 == K){
        rep(i,N) cout << "10";
        rep(i,M-N) cout << "1";
        cout << '\n';
        return 0;
    }
    if(K%2 == 1){
        rep(i,N-K/2) cout << "0";
        rep(i,K/2) cout << "10";
        rep(j,M-K/2) cout << "1";
        cout << '\n';
    }
    else{
        rep(i,N-K/2) cout << "0";
        rep(i,K/2-1) cout << "10";
        rep(j,M-K/2+1) cout << "1";
        cout << "0\n";
    }
    return 0;
}



struct ios_do_not_sync{
    ios_do_not_sync(){
        ios::sync_with_stdio(false);
        cin.tie(nullptr);
    }
} ios_do_not_sync_instance;