// #pragma GCC target("avx")
// #pragma GCC optimize("O3")
// #pragma GCC optimize("unroll-loops")

#include <bits/stdc++.h>
using namespace std;

#define rep(i,n) for(int i = 0; i < (int)n; i++)
#define FOR(n) for(int i = 0; i < (int)n; i++)
#define repi(i,a,b) for(int i = (int)a; i < (int)b; i++)
#define all(x) x.begin(),x.end()
//#define mp make_pair
#define vi vector<int>
#define vvi vector<vi>
#define vvvi vector<vvi>
#define vvvvi vector<vvvi>
#define pii pair<int,int>
#define vpii vector<pair<int,int>>

template<typename T>
void chmax(T &a, const T &b) {a = (a > b? a : b);}
template<typename T>
void chmin(T &a, const T &b) {a = (a < b? a : b);}

using ll = long long;
using ld = long double;
using ull = unsigned long long;

const ll INF = numeric_limits<long long>::max() / 2;
const ld pi = 3.1415926535897932384626433832795028;
const ll mod = 998244353;
int dx[] = {1, 0, -1, 0, -1, -1, 1, 1};
int dy[] = {0, 1, 0, -1, -1, 1, -1, 1};

#define int long long

vector<pair<char, int>> run_length_encoding(string s) {
    char need = s[0];
    int cnt = 0;
    vector<pair<char, int>> ret;
    for(char c : s) {
        if(c == need) {
            cnt++;
        }else {
            ret.emplace_back(need, cnt);
            need = c;
            cnt = 1;
        }
    }
    if(cnt != 0) ret.emplace_back(need, cnt);
    return ret;
}

void solve() {
    int n, m, k;
    cin >> n >> m >> k;

    int mx = (n==m? n+m : min(n, m)*2+1);

    if(k > mx) {
        cout << -1 << endl;
        return;
    }else if(k == 0 && (n != 0 && m != 0)) {
        cout << -1 << endl;
        return;
    }else if(k == 0) {
        string ans;
        FOR(n) ans.push_back('0');
        FOR(m) ans.push_back('1');
        cout << ans << endl;
        return;
    }
    
    string ans;
    FOR(k+1) {
        if(i%2==0) {
            if(n > 0) {
                --n;
                ans.push_back('0');
            }else {
                break;
            }
        }else {
            if(m > 0) {
                --m;
                ans.push_back('1');
            }else {
                break;
            }
        }
    }

    // cout << ans << endl;

    if(ans.size() == k+1) {
        reverse(all(ans));
        FOR(n) ans.push_back('0');
        reverse(all(ans));
        if(ans.back() == '0') {
            ans.pop_back();
            FOR(m) ans.push_back('1');
            ans.push_back('0');
        }else {
            FOR(m) ans.push_back('1');
        }
        cout << ans << endl;
    }else {
        reverse(all(ans));
        FOR(n) ans.push_back('0');
        ans.push_back('1');
        --m;
        reverse(all(ans));
        FOR(m) ans.push_back('1');
        cout << ans << endl;
    }
}

signed main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    solve();
    return 0;
}