#include <bits/stdc++.h>
using namespace std;
const long long mod = 1000000007;
long long powmod(long long a, long long b) {
  long long res = 1;
  a %= mod;
  assert(b >= 0);
  for (; b; b >>= 1) {
    if (b & 1) res = res * a % mod;
    a = a * a % mod;
  }
  return res;
}
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
double lg(double a) { return (log(a) / log(10.0)); }
const long long N = 111;
deque<int> v;
int main() {
  ios::sync_with_stdio(0);
  cin.tie(0);
  int p, x, a[2];
  cin >> a[0] >> a[1] >> x;
  p = a[1] > a[0];
  ++x;
  for (int i = x; i--; p ^= 1) {
    v.push_back(p);
    --a[p];
    if (i <= 1) {
      while (a[p]--) v.push_back(p);
    }
  }
  for (auto i : v) cout << i;
}
