#include <iostream>
#include <vector>
#include <set>
#include <queue>
#include <stack>
#include <math.h>
#include <cassert>
#include <bitset>
#include <map>
#include <algorithm>
#include <iterator>
#include <string>
#include <utility>
#include <numeric>
#include <regex>
#include <atcoder/all>
using namespace atcoder;
using namespace std;
using ll=long long;
using ull=unsigned long long;
using P=pair<ll,ll>;
template<typename T>using minque=priority_queue<T,vector<T>,greater<T>>;
template<typename T>bool chmax(T &a,const T &b){return (a<b?(a=b,true):false);}
template<typename T>bool chmin(T &a,const T &b){return (a>b?(a=b,true):false);}
template<typename T1,typename T2>
ostream &operator<<(ostream &os,const pair<T1,T2>&p){
  os<<p.first<<" "<<p.second;
  return os;
}
template<typename T1,typename T2>
istream &operator>>(istream &is,pair<T1,T2>&p){
  is>>p.first>>p.second;
  return is;
}
#define reps(i,a,n) for(int i=a;i<n;i++)
#define rep(i,n) reps(i,0,n)
#define all(x) x.begin(),x.end()
ll myceil(ll a,ll b){return (a+b-1)/b;}
int main(){
  int n,m,k;
  cin>>n>>m>>k;
  if(min(n,m)*2+1<k){
    cout<<-1<<endl;
    return 0;
  }
  if(n==m&&n<k){
    cout<<-1<<endl;
    return 0;
  }
  if(k%2==0){
    k/=2;
    n-=k;
    m-=k;
    rep(i,n-1)cout<<0;
    rep(i,k)cout<<"01";
    rep(i,m)cout<<1;
    cout<<0<<endl;
  }
  else{
    k/=2;
    k++;
    n-=k;
    m-=k;
    rep(i,n)cout<<0;
    rep(i,k)cout<<"01";
    rep(i,m)cout<<1;
    cout<<endl;
  }
}