#include "bits/stdc++.h"
using namespace std;
#define FOR(i,j,k) for(int (i)=(j);(i)<(int)(k);++(i))
#define rep(i,j) FOR(i,0,j)
#define each(x,y) for(auto &(x):(y))
#define mp make_pair
#define mt make_tuple
#define all(x) (x).begin(),(x).end()
#define debug(x) cout<<#x<<": "<<(x)<<endl
#define smax(x,y) (x)=max((x),(y))
#define smin(x,y) (x)=min((x),(y))
#define MEM(x,y) memset((x),(y),sizeof (x))
#define sz(x) (int)(x).size()
typedef long long ll;
typedef pair<int, int> pii;
typedef vector<int> vi;
typedef vector<ll> vll;

/**
A=B=C
閉路グラフ

A = C B > Cのとき
B=>(B-A-1)=>A

B=C A>Cのとき
A=>(B-A-1)=>B


A!=C かつ B!=C

A=>(A-C-1)=>C
B=>(B-C-1)=>C

**/

int A, B, C, D;

void solve() {
    int n = 0, m = 0;
    vector<pii> e;
    if(A == B&&B == C) {
        if(A < 2 || D < A)goto FAIL;
        n = A;
        rep(i, n)e.emplace_back(i, (i + 1) % n);
    } else if(A == C && B > C) {
        int pre = 1, cur = 2;
        rep(i, B - A - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }
        e.emplace_back(1, 0);
        pre = 0;
        rep(i, A - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }
        n = cur;
    } else if(B == C && A > C) {
        int pre = 0, cur = 2;
        rep(i, A - B - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }
        e.emplace_back(0, 1);
        pre = 1;
        rep(i, B - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }
        n = cur;
    } else if(A != C && B != C) {
        int pre = 0, cur = 2;
        rep(i, A - C - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }
        pre = 1;
        rep(i, B - C - 1) {
            e.emplace_back(pre, cur++);
            pre = cur - 1;
        }

        if(C != 0) {
            e.emplace_back(0, cur);
            e.emplace_back(1, cur);
            pre = cur;
            cur++;
            rep(i, C - 1) {
                e.emplace_back(pre, cur++);
                pre = cur - 1;
            }
        }
        n = cur;
    } else {
        goto FAIL;
    }

    if(sz(e) > D)goto FAIL;
    m = sz(e);
    cout << n << ' ' << m << endl;
    each(p, e)cout << p.first << ' ' << p.second << endl;
    return;
    FAIL:;
    cout << -1 << endl;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    
    while(cin >> A >> B >> C >> D) {
        solve();
    }
}