// #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(n+m, '1');

    {
        string ans1 = "0";
        int one = 0, zero = 1;
        int pos = 1;
        FOR(k) {
            char push = (char)('1' - i%2);
            if(push == '0') zero++;
            else one++, pos = i+1;
            ans1.push_back(push);
        }
        reverse(all(ans1));
        FOR(n-zero) ans1.push_back('0');
        reverse(all(ans1));
        pos += n-zero;
        ans1 = ans1.substr(0, pos) + string(max(0LL, m-one), '1') + ans1.substr(pos, ans1.size()-pos);

        if(count(all(ans1), '0') == n && count(all(ans1), '1') == m && ans1.size() == n+m && zero <= n && one <= m && run_length_encoding(ans1).size() == k+1) chmin(ans, ans1);
    }

    {
        string ans2 = "1";
        int one = 1, zero = 0;
        int zero_pos = 1, one_pos = 0;
        FOR(k) {
            char push = (char)('0' + i%2);
            if(push == '0') zero++;
            else one++, one_pos = i+1;
            ans2.push_back(push);
        }
        ans2 = ans2.substr(0, zero_pos) + string(max(0LL, n-zero), '0') + ans2.substr(zero_pos, ans2.size()-zero_pos);
        if(zero_pos < one_pos) one_pos += n-zero;
        ans2 = ans2.substr(0, one_pos) + string(max(0LL, m-one), '1') + ans2.substr(one_pos, ans2.size()-one_pos);

        if(count(all(ans2), '0') == n && count(all(ans2), '1') == m && ans2.size() == n+m && zero <= n && one <= m && run_length_encoding(ans2).size() == k+1) chmin(ans, ans2);
    }

    cout << ans << endl;
}

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