#include <iostream>
#include <algorithm>
#include <cassert>
#include <cmath>
#include <cstdio>
#include <cstdlib>
#include <climits>

using namespace std;

int archi[2048000];
int albero[10240];

int main()
{
	int S, N, M, L, a, b;

	cerr << "Genero un input casuale per Atollo." << endl;

	cerr << "Inserisci il seme per il generatore di numeri casuali: ";
	cin >> S;
	srand(S);

	cerr << "Inserisci il numero di isolotti N, e i numeri di ponti M, L: ";
	cin >> N >> M >> L;
	assert(M+L >= N-1);

	cout << N << " " << M << " " << L << endl;
	for (int i=1; i<N; i++) {
		albero[i-1] = i*(i-1)/2 + (int)(rand()/(INT_MAX+1.0)*(i-1)+1);
	}
	albero[N-1] = N*N;
	for (int i=N-1; i<M+L; i++) {
		archi[i-N+1] = (int)(rand()/(INT_MAX+1.0)*(N*(N-1)/2-M-L+1));
	}
	archi[M+L-N+1] = N*N-1;
	sort(archi,archi+M+L);
	for (int i=0, j=0; i+j<M+L; i++) {
		for (; albero[j]<=archi[i]+i+j; j++);
		archi[i] += i+j;
	}
	for (int i=0; i<N-1; i++) {
		archi[i+M+L-N+1] = albero[i];
	}

	for (int i=1; i<M+L; i++) {
		a = (int)(rand()/(INT_MAX+1.0)*i);
		archi[i] ^= archi[a];
		archi[a] ^= archi[i];
		archi[i] ^= archi[a];
	}

	for (int i=0; i<M+L; i++) {
		a = (int)(round(sqrt(2*(archi[i]+1))));
		b = archi[i] - a*(a-1)/2;
		cout << b+1 << " " << a+1 << endl;
	}
	return 0;
}