#include using namespace std; #define int long long #define INF (int)1e18 #define f first #define s second mt19937_64 RNG(chrono::steady_clock::now().time_since_epoch().count()); void Solve() { int n, m, k; cin>>n>>m>>k; if (k==0){ if (n==0){ while (m--){ cout<<1; } return; } else if (m==0) { while (n--){ cout<<0; } return; } else { cout<<-1<<"\n"; return; } } int mx = (n==m)? n + m - 1 : min(n, m) * 2; if (k>mx || k<1) { cout<<-1<<"\n"; return; } if (k == 2 * n && n!=m){ for (int i=1; i<=n; i++){ cout<<"10"; m--; } while (m--) cout<<1; return; } if (k%2==1){ int use = (k+1)/2; n-= use; for (int i=0; i> t; for(int i = 1; i <= t; i++) { //cout << "Case #" << i << ": "; Solve(); } auto end = std::chrono::high_resolution_clock::now(); auto elapsed = std::chrono::duration_cast(end - begin); cerr << "Time measured: " << elapsed.count() * 1e-9 << " seconds.\n"; return 0; }