#include <bits/stdc++.h>
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
#define rep(i,n) for(int i=0;i<(int)(n);i++)
#define codefor int test;cin>>test;while(test--)
#define INT(...) int __VA_ARGS__;in(__VA_ARGS__)
#define LL(...) ll __VA_ARGS__;in(__VA_ARGS__)
#define vector2d(type,name,h,...) vector<vector<type>>name(h,vector<type>(__VA_ARGS__))
#define vector3d(type,name,h,w,...) vector<vector<vector<type>>>name(h,vector<vector<type>>(w,vector<type>(__VA_ARGS__)))
using namespace std;
using ll = long long;
template<class T> using rpriority_queue = priority_queue<T, vector<T>, greater<T>>;
template<class T> istream& operator>>(istream& is, vector<T>& vec) {for(T& x : vec)is >> x;return is;}
template<class T> ostream& operator<<(ostream& os, const vector<T>& vec) {if(vec.empty())return os;os << vec[0];for(auto it = vec.begin(); ++it!= vec.end();)os << ' ' << *it;return os;}
void in(){}
template <class Head, class... Tail> void in(Head& head, Tail&... tail){cin >> head;in(tail...);}
void out(){cout << '\n';}
template<class T>void out(const T& a){cout << a << '\n';}
template <class Head, class... Tail> void out(const Head& head,const Tail&... tail){cout << head << ' ';out(tail...);}
const int INF = 1 << 30;
const long long INF2 = 1ll << 60;
template<class T> void chmax(T &a,const T b){if(b>a)a=b;}
template<class T> void chmin(T &a,const T b){if(b<a)a=b;}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    int n, m, k;
    cin >> n >> m >> k;
    if(n == 0 || m == 0){
        if(k == 0){
            cout << (m == 0 ? string(n, '0') : string(m, '1')) << '\n';
            return 0;
        }
        cout << -1 << '\n';
        return 0;
    }
    if(k == 0){
        cout << -1 << '\n';
        return 0;
    }
    if(n == m){
        if(k > n){
            cout << -1 << '\n';
            return 0;
        }
        string ans(1, '0');
        n--;
        for(int i = 0; i < k; i++){
            if(ans.back() == '0'){
                ans += '1';
                m--;
            }else{
                ans += '0';
                n--;
            }
        }
        ans = string(n, '0') + ans;
        for(int i = 0; i < ans.size(); i++){
            if(ans[i] == '1'){
                ans = ans.substr(0, i) + string(m, '0') + ans.substr(i, ans.size() - i);
                break;
            }
        }
        cout << ans << '\n';
    }else{
        if(k > min(n, m) + 1){
            cout << -1 << '\n';
            return 0;
        }
        string ans;
        if(n > m) ans += '0', n--;
        else ans += '1', m--;
        for(int i = 0; i < k; i++){
            if(ans.back() == '0'){
                ans += '1';
                m--;
            }else{
                ans += '0';
                n--;
            }
        }
        for(int i = 0; i < ans.size(); i++){
            if(ans[i] == '0'){
                ans = ans.substr(0, i) + string(n, '0') + ans.substr(i, ans.size() - i);
                break;
            }
        }
        for(int i = 0; i < ans.size(); i++){
            if(ans[i] == '1'){
                ans = ans.substr(0, i) + string(m, '1') + ans.substr(i, ans.size() - i);
                break;
            }
        }
        cout << ans << '\n';
    }
}