#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 4e5 + 1, M = 51, K = 26, mod = 1e9 + 7;

mt19937 rnd(time(nullptr));

void solve() {
    
    int n = 1000, w = 1000;
    cout << n << " " << w << endl;
    cout << "10000 1\n";
    for (int i = 2; i <= n; ++i) {
        cout << (i - 1) * 10001 << " " << i << endl;
    }
    
}

void init() {
    
}

int main() {
    init();
    int testCases = 1;
//    cin >> testCases;
    for (int testCase = 1; testCase <= testCases; ++testCase) {
        solve();
    }
}