# include using namespace std; using LL = long long; using ULL = unsigned long long; const double PI = acos(-1); templateconstexpr T INF() { return ::std::numeric_limits::max(); } templateconstexpr T HINF() { return INF() / 2; } template T_char TL(T_char cX) { return tolower(cX); } template T_char TU(T_char cX) { return toupper(cX); } template bool chmin(T& a,T b) { if(a > b){a = b; return true;} return false; } template bool chmax(T& a,T b) { if(a < b){a = b; return true;} return false; } template bool is_sqare(T a) { if(floor(sqrt(a)) * floor(sqrt(a)) == a){ return true; }return false; } int popcnt(unsigned long long n) { int cnt = 0; for (int i = 0; i < 64; i++)if ((n >> i) & 1)cnt++; return cnt; } int d_sum(LL n) { int ret = 0; while (n > 0) { ret += n % 10; n /= 10; }return ret; } int d_cnt(LL n) { int ret = 0; while (n > 0) { ret++; n /= 10; }return ret; } template using dijk = priority_queue, greater>; # define ALL(qpqpq) (qpqpq).begin(),(qpqpq).end() # define UNIQUE(wpwpw) sort(ALL((wpwpw)));(wpwpw).erase(unique(ALL((wpwpw))),(wpwpw).end()) # define LOWER(epepe) transform(ALL((epepe)),(epepe).begin(),TL) # define UPPER(rprpr) transform(ALL((rprpr)),(rprpr).begin(),TU) # define REP(i,upupu) for(LL i = 0, i##_len = (upupu);(i) < (i##_len);(i)++) # define REPS(i,opopo) for(LL i = 1, i##_len = (opopo);(i) <= (i##_len);(i)++) # define len(x) ((int)(x).size()) # define BIT(n) (1LL << (n)) # define pb push_back #ifdef LOCAL # include "_debug_print.hpp" # define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__) #else # define debug(...) (static_cast(0)) #endif struct INIT{ INIT(){ std::ios::sync_with_stdio(false); std::cin.tie(0); cout << fixed << setprecision(20); } }INIT; void solve(){ int n, m, k; cin >> n >> m >> k; if(n == 0 || m == 0){ if(k == 0){ cout << (m == 0 ? string(n, '0') : string(m, '1')) << endl; }else{ cout << -1 << endl; } return; } if(k == 0){ cout << -1 << endl; return; } string ans = ""; REP(i, k){ if(i % 2 == 0){ ans += '0'; n--; if(n == 0){ cout << -1 << endl; return; } }else{ ans += '1'; m--; if(m == 0){ cout << -1 << endl; return; } } } ans += string(n, '0'); if(ans.back() == '0'){ ans = ans.substr(0, len(ans) - 1); ans += string(n, '1'); ans += '1'; }else{ ans += string(m, '1'); } cout << ans << endl; } int main(){ int t = 1; //cin >> t; while(t--)solve(); }