#include <bits/stdc++.h>
using namespace std;
typedef pair<int, int> pr;
const int n = 252;
vector<pr> e;
vector<int> g[10005];
int a[10005];
int main() {
	freopen("1.txt", "w", stdout);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j < i; j++) {
			e.push_back(pr(i, j));
			e.push_back(pr(i + n, j));
			e.push_back(pr(i + n + n, j + n + n));
			e.push_back(pr(i + n + n + n, j + n + n + n));
		}
		for (int j = 1; j <= n; j++) {
			e.push_back(pr(i + n + n, j + n));
			e.push_back(pr(i + n + n + n, j + n + n));
			e.push_back(pr(i + n + n + n, j + n));
		}
	}
	cout << 4 * n << ' ' << e.size() << ' ' << n + 1 << '\n';
	for (int i = 1; i <= n; i++) cout << i << ' ';
	for (int i = 1; i <= n; i++) cout << n + 1 << ' ';
	for (int i = 1; i <= n; i++) cout << i << ' ';
	for (int i = 1; i <= n; i++) cout << i << ' ';
	cout << '\n';
	for (auto [x, y] : e) cout << x << ' ' << y << '\n', g[max(x, y)].push_back(min(x, y));
	/*for (int i = 1; i <= 4 * n; i++) {
	    a[i] = 1;
	    map<int, int> b;
	    for (int j : g[i]) b[a[j]] = 1;
	    while (b[a[i]]) a[i]++;
	    cerr << i << ' ' << a[i] << '\n';
	}*/
}