#include <bits/stdc++.h>
using namespace std;
const int MOD = 1000000007;
const long long LINF = 4611686018427387903;
const int dir4[4][2] = {{1, 0}, {0, 1}, {-1, 0}, {0, -1}};
const int dir8[8][2] = {{1, 0}, {0, 1},   {-1, 0}, {0, -1},
                        {1, 1}, {-1, -1}, {1, -1}, {-1, 1}};
const int dir63[6][3] = {{0, 0, 1},  {0, 0, -1}, {0, 1, 0},
                         {0, -1, 0}, {1, 0, 0},  {-1, 0, 0}};
const int daym[2][13] = {{0, 31, 28, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31},
                         {0, 31, 29, 31, 30, 31, 30, 31, 31, 30, 31, 30, 31}};
int GCD(int a, int b) { return b ? GCD(b, a % b) : a; }
char s[211];
int main() {
  int a, b, n;
  scanf("%d %d %d", &a, &b, &n);
  if (a < b) {
    s[0] = '1';
    b--;
  } else {
    s[0] = '0';
    a--;
  }
  int p = 1;
  while (n > 1) {
    n--;
    if (s[p - 1] == '1') {
      s[p++] = '0';
      a--;
    } else {
      s[p++] = '1';
      b--;
    }
  }
  if (s[p - 1] == '0') {
    while (a--) s[p++] = '0';
    while (b--) s[p++] = '1';
    s[p] = '\0';
  } else {
    while (b--) s[p++] = '1';
    while (a--) s[p++] = '0';
    s[p] = '\0';
  }
  printf("%s\n", s);
  return 0;
}
