#include<iostream>
#include<vector>
#include<algorithm>
using namespace std;
int N,M,K;
int main()
{
	cin>>N>>M>>K;
	if(K==0)
	{
		if(N==0)cout<<string(M,'1')<<endl;
		else if(M==0)cout<<string(N,'0')<<endl;
		else cout<<-1<<endl;
		return 0;
	}
	if(N==0||M==0)
	{
		cout<<-1<<endl;
		return 0;
	}
	vector<pair<int,int> >ans;
	for(int t=0;t<2;t++)
	{
		vector<pair<int,int> >now;
		now.push_back(make_pair(t,1));
		int n=N,m=M;
		if(t==0)n--;
		else m--;
		for(int k=0;k<K;k++)
		{
			int v=now.back().first;
			v=1-v;
			now.push_back(make_pair(v,1));
			if(v==0)n--;
			else m--;
		}
		if(n<0||m<0)continue;
		//0
		if(n>0)
		{
			int id=0;
			while(now[id].first!=0)id++;
			now[id].second+=n;
		}
		//1
		if(m>0)
		{
			int id=(int)now.size()-1;
			while(now[id].first!=1)id--;
			now[id].first+=m;
		}
		ans=now;
		break;
	}
	if(ans.empty())cout<<-1<<endl;
	else
	{
		for(pair<int,int>p:ans)for(int i=0;i<p.second;i++)cout<<p.first;
		cout<<endl;
	}
}