import std.conv, std.functional, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.container, std.math, std.numeric, std.range, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


int A, B, C, D;

void main() {
  try {
    for (; ; ) {
      A = readInt();
      B = readInt();
      C = readInt();
      D = readInt();
      debug {
        writeln([A, B, C, D]);
      }
      
      int V;
      Tuple!(int, int)[] edges;
      if (false) {
      } else if (C == A && C < B && 1 + (C - 1) + (B - C - 1) <= D) {
        // 1->0
        edges ~= tuple(1, 0);
        V = 2;
        foreach (i; 0 .. C - 1) {
          edges ~= tuple(0, V++);
        }
        foreach (i; 0 .. B - C - 1) {
          edges ~= tuple(1, V++);
        }
      } else if (C < A && C == B && 1 + (C - 1) + (A - C - 1) <= D) {
        // 0->1
        edges ~= tuple(0, 1);
        V = 2;
        foreach (i; 0 .. C - 1) {
          edges ~= tuple(1, V++);
        }
        foreach (i; 0 .. A - C - 1) {
          edges ~= tuple(0, V++);
        }
      } else if (C == 0 && (A - 1) + (B - 1) <= D) {
        // ...<-0, 1->...
        V = 2;
        foreach (i; 0 .. A - 1) {
          edges ~= tuple(0, V++);
        }
        foreach (i; 0 .. B - 1) {
          edges ~= tuple(1, V++);
        }
      } else if (C < A && C < B && 2 + (C - 1) + (A - C - 1) + (B - C - 1) <= D) {
        // ...<-0->2<-1->...
        V = 3;
        edges ~= tuple(0, 2);
        edges ~= tuple(1, 2);
        foreach (i; 0 .. C - 1) {
          edges ~= tuple(2, V++);
        }
        foreach (i; 0 .. A - C - 1) {
          edges ~= tuple(0, V++);
        }
        foreach (i; 0 .. B - C - 1) {
          edges ~= tuple(1, V++);
        }
      }
      if (V) {
        assert(V == A + B - C);
        assert(edges.length <= D);
        writeln(V, " ", edges.length);
        foreach (e; edges) {
          writeln(e[0], " ", e[1]);
        }
      } else {
        writeln(-1);
      }
    }
  } catch (EOFException e) {
  }
}