#include <bits/stdc++.h>   using namespace std;   int main() {     int arr[2], x;     cin >> arr[0] >> arr[1] >> x;     vector<int> v;     int curr = 1;     if (x % 2 == 1) {       v.push_back(curr);       arr[curr]--;       curr ^= 1;       for (int i = 0; i < x; i++) {         v.push_back(curr);         arr[curr]--;         curr ^= 1;       }       if (arr[1] > 0) {         while (arr[1]--) {           cout <<  1 ;         }       }       for (int i = 0; i < v.size(); i++) cout << v[i];       if (arr[0] > 0) {         while (arr[0]--) cout <<  0 ;       }     } else {       if (arr[0] <= arr[1]) {         v.push_back(curr);         arr[curr]--;         curr ^= 1;         for (int i = 0; i < x; i++) {           v.push_back(curr);           arr[curr]--;           curr ^= 1;         }         if (arr[1] > 0) {           while (arr[1]--) cout <<  1 ;         }         for (int i = 0; i < v.size() - 1; i++) cout << v[i];         if (arr[0] > 0) {           while (arr[0]--) cout <<  0 ;         }         cout <<  1 ;       } else {         curr = 0;         v.push_back(curr);         arr[curr]--;         curr ^= 1;         for (int i = 0; i < x; i++) {           v.push_back(curr);           arr[curr]--;           curr ^= 1;         }         if (arr[0] > 0) {           while (arr[0]--) cout <<  0 ;         }         for (int i = 0; i < v.size() - 1; i++) cout << v[i];         if (arr[1] > 0) {           while (arr[1]--) cout <<  1 ;         }         cout <<  0 ;       }     }     cout << endl;   }   