#include<bits/stdc++.h>

using namespace std;
typedef unsigned int uint;
typedef long long int ll;
typedef unsigned long long int ull;

#define debugv(v) printf("L%d %s => ",__LINE__,#v);for(auto e:v){cout<<e<<" ";}cout<<endl;
#define debugm(m) printf("L%d %s is..\n",__LINE__,#m);for(auto v:m){for(auto e:v){cout<<e<<" ";}cout<<endl;}
#define debuga(m,w) printf("L%d %s is => ",__LINE__,#m);for(int x=0;x<(w);x++){cout<<(m)[x]<<" ";}cout<<endl;
#define debugaa(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[x][y]<<" ";}cout<<endl;}
#define debugaar(m,w,h) printf("L%d %s is..\n",__LINE__,#m);for(int y=0;y<(h);y++){for(int x=0;x<(w);x++){cout<<(m)[y][x]<<" ";}cout<<endl;}
#define ALL(v) (v).begin(),(v).end()
#define BIGINT 0x7FFFFFFF
#define E107 1000000007ll
void printbit(int u){if(u==0)cout<<0;else{int s=0,k=0;for(;0<u;u>>=1,k++)s=(s<<1)|(u&1);for(;0<k--;s>>=1)cout<<(s&1);}}

#define TIME chrono::system_clock::now()
#define MILLISEC(t) (chrono::duration_cast<chrono::milliseconds>(t).count())

template<typename T1,typename T2>
ostream& operator <<(ostream &o,const pair<T1,T2> p){o<<"("<<p.first<<":"<<p.second<<")";return o;}

int width,height;
int m,n;

int ai,bi,ci;

struct Iroha{
    int maxvertex = 2;
    int limit;
    vector<pair<int,int>> q;
    set<int> checker;
    
    Iroha(int n=100){
        q.reserve(n);
        limit = n;
    }
    
    void insert(int a,int b){
        q.emplace_back(a,b);
        checker.insert(a);
        checker.insert(b);
        maxvertex=max(maxvertex,max(a,b)+1);
    }
    
    bool check(){
        int k=2;
        for (int e : checker){
            if (e<2) continue;
            if (e!=k) return false;
            k++;
        }
        return (k == maxvertex);
    }
    
    void print(){
        if (limit < q.size()){
            cout << -1 << endl;
        }else{
            assert(check());
            printf("%d %d\n",maxvertex,q.size());
            for (auto e:q){
                printf("%d %d\n",e.first,e.second);
            }
        }
    }
};

void halt(){
    cout << -1 << endl;
    exit(0);
}

void wait(int ms){
    for (auto t=TIME;MILLISEC(TIME-t)<ms;);
}

// いろはちゃんの故郷では、いくつかの村がいくつかの向きのある水路によってつながれていました。
// なので，すべての村に水を流す必要がある(?)

int main(){
    int i,j,k;
    int x,y,a,b;
    
    cin >> ai >> bi >> ci >> n;
    
    Iroha graph(n);
    
    if (ai == 1 && bi==1 && ci==1) halt();
    
    assert(ci<=min(ai,bi));
    
    if (ai==ci && bi==ci){
        // cycle
        
        for (i=1;i<ai;i++){
            graph.insert(i-1,i);
        }
        graph.insert(ai-1,0);
        
        graph.print();exit(0);
    }
    
    if (ai==ci){
        // path(1->...->0->...)
        
        k=1;
        for (i=0;i<bi-ci-1;i++){
            graph.insert(k,k+1);
            k++;
        }
        graph.insert(k,0);
        if (ci>1){
            k++;
            graph.insert(0,k);
            for (i=0;i<ci-2;i++){
                graph.insert(k,k+1);
                k++;
            }
        }
        graph.print();exit(0);
    }
    if (bi==ci){
        // path(0->...->1->...)
        cerr<< "!" << endl;
        k=1;
        if (ai-ci>1){
            k=2;
            graph.insert(0,2);
            for (i=0;i<ai-ci-2;i++){
                graph.insert(k,k+1);
                k++;
            }
            graph.insert(k,1);
        }else{
            graph.insert(0,1);
        }
        
        if (ci>1){
            k++;
            graph.insert(1,k);
            for (i=0;i<ci-2;i++){
                graph.insert(k,k+1);
                k++;
            }
        }
        
        graph.print();exit(0);
    }
    
    if (ci==0){
        // path x2
        
        k=1;
        for (i=0;i<bi-1;i++){
            graph.insert(k,k+1);
            k++;
        }
        if (ai>1){
            k++;
            graph.insert(0,k);
            for (i=0;i<ai-2;i++){
                graph.insert(k,k+1);
                k++;
            }
        }
        graph.print();exit(0);
    }
    
    if (true){
        // sasumatha
        
        for (k=1;k<bi;k++){
            graph.insert(k,k+1);
        }
        if (ci+1==ai){
            graph.insert(0,bi-ci+1); // no testcase?
        }else{
            k++;
            graph.insert(0,k);
            for (i=0;i<ai-ci-2;i++){
                graph.insert(k,k+1);
                k++;
            }
            graph.insert(k,bi-ci+1);
        }
        graph.print();exit(0);
    }
    cerr << "!" << endl;

    return 0;
}