#include <bits/stdc++.h>
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
#define fix(x) fixed << setprecision(x)
#define asc(x) x, vector<x>, greater<x>
#define rep(i, n) for(ll i = 0; i < n; i++)
#define all(x) (x).begin(),(x).end()
template<class T>bool chmin(T&a, const T&b){if(a>b){a=b;return 1;}return 0;}
template<class T>bool chmax(T&a, const T&b){if(a<b){a=b;return 1;}return 0;}
constexpr ll INFLL = (1LL << 62), MOD = 998244353;
constexpr int INF = (1 << 30);

int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n,m,k;
    cin >> n >> m >> k;
    string s;
    int x[2] = {n,m};
    rep(i,k+1){
        if(!x[i&1]) break;
        s += '0' + (i&1);
        x[i&1]--;
        if(i==k){
            rep(j,x[0]) cout << 0;
            if(s.back()=='0'){
                s.pop_back();
                cout << s;
                rep(j,x[1]) cout << 1;
                cout << 0 << '\n';
            }else{
                cout << s;
                rep(j,x[1]) cout << 1;
                cout << '\n';
            }
            return 0;
        }
    }
    x[0] = n, x[1] = m;
    s = "";
    rep(i,k+1){
        if(!x[(i^1)&1]) break;
        s += '0' + ((i^1)&1);
        x[(i^1)&1]--;
        if(i==k){
            rep(j,x[0]) cout << 0;
            if(s.back()=='0'){
                s.pop_back();
                cout << s;
                rep(j,x[1]) cout << 1;
                cout << 0 << '\n';
            }else{
                cout << s;
                rep(j,x[1]) cout << 1;
                cout << '\n';
            }
            return 0;
        }
    }
    cout << "-1\n";
    return 0;
}