#include using namespace std; #define _p(...) (void)printf(__VA_ARGS__) #define forr(x,arr) for(auto&& x:arr) #define _overload3(_1,_2,_3,name,...) name #define _rep2(i,n) _rep3(i,0,n) #define _rep3(i,a,b) for(int i=int(a);i=int(a);i--) #define rrep(...) _overload3(__VA_ARGS__,_rrep3,_rrep2,)(__VA_ARGS__) #define all(x) (x).begin(), (x).end() #define bit(n) (1LL<<(n)) #define sz(x) ((int)(x).size()) #define fst first #define snd second using ll=long long;using pii=pair; using vb=vector;using vs=vector; using vi=vector;using vvi=vector;using vvvi=vector; using vl=vector;using vvl=vector;using vvvl=vector; using vd=vector;using vvd=vector;using vvvd=vector; using vpii=vector;using vvpii=vector;using vvvpii=vector; templateT read(){T t;cin>>t;return t;} templateostream&operator<<(ostream&o,const pair&p){o<<'('<(); b = read(); c = read(); d = read(); int vc = 2; vpii ans; if (a == c && b == c) { ans.emplace_back(0, 1); ans.emplace_back(1, 0); rep(i, 2, c) { ans.emplace_back(i-1, i); } return ans; } else if (b == c) { ans.emplace_back(0, 1); vc = 1; } else if (a == c) { ans.emplace_back(1, 0); vc = 0; } else if (c == 0) { vc = 1; } int idx = vc + 1; { int p = 0; rep(i, a - c - 1) { int v = idx++; //_p("a:%d,%d\n", p, v); ans.emplace_back(p, v); p = v; } } { int p = 1; rep(i, b - c - 1) { int v = idx++; //_p("b:%d,%d\n", p, v); ans.emplace_back(p, v); p = v; } } { int p = vc; if (vc != 0 && vc != 1 && c != 0) { ans.emplace_back(0, vc); ans.emplace_back(1, vc); } rep(i, c - 1) { int v = idx++; //_p("c:%d,%d\n", p, v); ans.emplace_back(p, v); p = v; } } //cout << "ans:"; rep(ii,sz(ans)) cout << ' ' << ans[ii]; cout << endl; return ans; } void Main() { vpii ans = solve(); int m = sz(ans); if (m > d) panic(); int n = -1; rep(i, m) { n = max(n, ans[i].fst + 1); n = max(n, ans[i].snd + 1); } _p("%d %d\n", n, m); rep(i, m) { _p("%d %d\n", ans[i].fst, ans[i].snd); } } int main() { cin.tie(nullptr); ios::sync_with_stdio(false); Main(); return 0; }