#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() {
	for (int i = 1; i <= 252; i++) {
		e.push_back(pr(4 * i - 3, 4 * i - 2));
		if (i < 252) e.push_back(pr(4 * i - 1, 4 * i));
		for (int j = 1; j < i; j++) {
			e.push_back(pr(4 * i - 3, 4 * j - 2));
			e.push_back(pr(4 * i - 3, 4 * j - 1));

			e.push_back(pr(4 * i - 2, 4 * j - 3));
			e.push_back(pr(4 * i - 2, 4 * j));

			if (i < 252) e.push_back(pr(4 * i - 1, 4 * j - 3));
			if (i < 252) e.push_back(pr(4 * i - 1, 4 * j));

			if (i < 252) e.push_back(pr(4 * i, 4 * j - 2));
			if (i < 252) e.push_back(pr(4 * i, 4 * j - 1));
		}
	}
	cout << 1006 << ' ' << e.size() << ' ' << 2 << '\n';
	for (int i = 1; i <= 1006; i++) {
		int c = 1;
		if (i % 4 == 2 || i % 4 == 3) c = 2;
		cout << c << ' ';
	}
	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 <= 1006; 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';
	}*/
}