#!/usr/bin/ python3.8
import sys
read = sys.stdin.buffer.read
readline = sys.stdin.buffer.readline
readlines = sys.stdin.buffer.readlines

A, B, C, D = map(int, read().split())


def output(edges):
    M = len(edges)
    if M == 0:
        print(2, 0)
        exit()
    A, B = zip(*edges)
    N = 1 + max(A + B)
    if M > D:
        print(-1)
    else:
        print(N, M)
        for a, b in zip(A, B):
            print(a, b)


def solve(A, B, C):
    if A == B == C:
        if A == 1:
            print(-1)
            exit()
        return [(n, (n + 1) % A) for n in range(A)]
    edges = []
    if A == C < B:
        edges += [(1, 0)]
        for n in range(2, C + 1):
            edges.append((0, n))
        for n in range(C + 1, B):
            edges.append((1, n))
        return edges
    if B == C < A:
        edges += [(0, 1)]
        for n in range(2, C + 1):
            edges.append((1, n))
        for n in range(C + 1, A):
            edges.append((0, n))
        return edges
    if C == 0:
        for n in range(2, A + 1):
            edges.append((0, n))
        for n in range(A + 1, A + B):
            edges.append((1, n))
        return edges
    edges.append((0, 2))
    edges.append((1, 2))
    for n in range(2, C + 1):
        edges.append((n, n + 1))
    for n in range(C + 2, A + 1):
        edges.append((0, n))
    for n in range(A + 1, A + 1 + B - C - 1):
        edges.append((1, n))
    return edges


edges = solve(A, B, C)
output(edges)