#include <iostream>
#include <vector>
using namespace std;

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

    int N = A + B - C;
    if (N < 2) {
        cout << -1 << endl;
        return 0;
    }

    int min_edges = A + B - C - 1;
    if (min_edges > D) {
        cout << -1 << endl;
        return 0;
    }

    cout << N << " " << min_edges << endl;

    // Construct the graph
    vector<pair<int, int>> edges;

    // Only from 0: A - C nodes (including 0)
    int last = 0;
    for (int i = 2; i < 2 + (A - C - 1); ++i) {
        edges.emplace_back(last, i);
        last = i;
    }

    // Only from 1: B - C nodes (including 1)
    last = 1;
    for (int i = 2 + (A - C - 1); i < 2 + (A - C - 1) + (B - C - 1); ++i) {
        edges.emplace_back(last, i);
        last = i;
    }

    // Common part: C nodes
    if (C > 0) {
        int common_start = 2 + (A - C - 1) + (B - C - 1);
        edges.emplace_back(0, common_start);
        edges.emplace_back(1, common_start);
        last = common_start;
        for (int i = 1; i < C; ++i) {
            edges.emplace_back(last, common_start + i);
            last = common_start + i;
        }
    }

    // Output edges
    for (auto& edge : edges) {
        cout << edge.first << " " << edge.second << endl;
    }

    return 0;
}