def solve(A, B, C, D):
    '''
    入力値
    A: 0 から到達できる頂点の個数（0を含む）
    B: 1 から到達できる頂点の個数（1を含む）
    C: 0 からも、1 からも到達できる頂点の個数
    D: 辺の数の上限
    
    '''
    a = A - C
    b = B - C
    if a == b == 0:
        N = M = A
        if N >= 2 and M <= D:
            print(N, M)
            Es = list(range(N)) + [0]
            printEs(Es)
            return
    elif C == 0:
        N = A + B
        M = N - 2
        if M <= D:
            print(N, M)
            Es = [0] + list(range(2, a + 1))
            printEs(Es)
            Es = [1] + list(range(a + 1, N))
            printEs(Es)
            return
    elif a == 0:
        N = B
        M = N - 1
        if M <= D:
            print(N, M)
            Es = list(range(1, b + 1)) + [0] + list(range(b + 1, N))
            printEs(Es)
            return
    elif b == 0:
        N = A
        M = N - 1
        if M <= D:
            print(N, M)
            Es = [0] + list(range(2, a + 1)) + [1] + list(range(a + 1, N))
            printEs(Es)
            return
    else:
        N = C + a + b
        M = N - 1
        v = a + b
        if M <= D:
            print(N, M)
            Es = [0] + list(range(2, a + 1)) + [v]
            printEs(Es)
            Es = [1] + list(range(a + 1, N))
            printEs(Es)
            return
    print(-1)
    
def printEs(Es):
    for a, b in zip(Es, Es[1:]):
        print(a, b)

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