#include <bits/stdc++.h>
using namespace std;
using ll = long long;
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define all(c) begin(c), end(c)
#define dump(x) cerr << __LINE__ << ":\t" #x " = " << (x) << endl

void fail(){
    puts("-1");
    exit(0);
}

int main(){
    int A, B, C, D;
    cin >> A >> B >> C >> D;
    A -= C;
    B -= C;

    int k = 2;
    set<pair<int,int>> es;
    vector<int> as, bs, cs;

    if(C < !A + !B) fail();
    if(!C){
        as.push_back(0);
        bs.push_back(1);
    } else {
        (A ? as : cs).push_back(0);
        (B ? bs : cs).push_back(1);
        rep(i, C - !A - !B) cs.push_back(k++);
    }
    rep(i, A - 1) as.push_back(k++);
    rep(i, B - 1) bs.push_back(k++);

    rep(i, A - 1) es.emplace(as[i], as[i+1]);
    rep(i, B - 1) es.emplace(bs[i], bs[i+1]);
    rep(i, C - 1) es.emplace(cs[i], cs[i+1]);
    if(A && C) es.emplace(0, cs[0]);
    if(B && C) es.emplace(1, cs[0]);
    if(!A && !B) es.emplace(0, 1), es.emplace(1, 0);

    if((int)es.size() > D) fail();
    int n = A + B + C;
    int m = es.size();
    cout << n << ' ' << m << '\n';
    for(auto &e : es) cout << e.first << ' ' << e.second << '\n';
}