#include<iostream>
#include<algorithm>
#include<stack>
#include<vector>
#include<set>
#include<string>
#include<cstdint>
#include<queue>

using namespace std;
using ll = long long;
        
int main(){
    cin.tie(nullptr);
    ios::sync_with_stdio(false);

    int n,m,k;
    cin>>n>>m>>k;

    if(n==0||m==0){
        if(k!=0) cout<<-1<<endl;
        else{
            if(n) {
                for(int i = 0;i<n;i++) cout<<0;
                cout<<endl;
            }else{
                for(int i = 0;i<m;i++) cout<<1;
                cout<<endl;
            }
        }
        return 0;
    }
    if(k==0){
        cout<<"-1\n";
        return 0;
    }

    int right = n;
    int left = m;

    for(int i = 1;i<=n;i++){
        int cnt = 0;
        int need = i - 1;
        cnt += need * 2;
        if(need>m) continue;
        if(cnt==k){
            int left = n - i;
            for(int j = 0;j<left;j++) cout<<0;
            for(int j = 0;j<i;j++){
                cout<<0;
                if(j==i-1) continue;
                cout<<1;
                if(j==i-2){
                    for(int j = 0;j<m-need;j++) cout<<1;
                }
            }
            cout<<endl;
            return 0;
        }
        if(cnt+1==k&&need<m){
            int left = n - i;
            for(int j = 0;j<left;j++) cout<<0;
            for(int j = 0;j<i;j++){
                cout<<0;
                if(j==i-1) continue;
                cout<<1;
            }
            for(int j = 0;j<m-need;j++) cout<<1;
            cout<<endl;
            return 0;
        }
    }

    int cnt = 2 * n;
    if(cnt==k&&m>n){
        for(int i = 0;i<n;i++) cout<<1<<0;
        for(int i = 0;i<m-n;i++) cout<<1;
        cout<<endl;
        return 0;
    }

        
    
    cout<<-1<<endl;
}