#include <bits/stdc++.h>
using namespace std;

int main() {
    int n, m;
    cin >> n >> m;
    vector<int> a(n), b(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i] >> b[i];
    }

    vector<int> sx{400, 600, 200, 400, 600, 800, 400, 600};
    vector<int> sy{250, 250, 500, 500, 500, 500, 750, 750};
    for (int i = 0; i < m; i++) {
        cout << sx[i] << ' ' << sy[i] << endl;
    }

    auto comp = [&](int x, int y) {
        return atan2(b[x] - 500, a[x] - 500) < atan2(b[y] - 500, a[y] - 500);
    };

    vector<int> ord(n + 1);
    for (int i = 0; i < n; i++) {
        ord[i] = i;
    }
    ord[n] = 0;
    sort(ord.begin() + 1, ord.end() - 1, comp);

    vector<int> t, r;
    for (int i = 0; i < n; i++) {
        t.push_back(1);
        r.push_back(ord[i] + 1);
        int a0 = a[ord[i]], a1 = a[ord[i + 1]];
        int b0 = b[ord[i]], b1 = b[ord[i + 1]];
        int dx = a1 - a0, dy = b1 - b0;
        int best = 5 * (dx * dx + dy * dy), best_idx = -1;
        for (int j = 0; j < m; j++) {
            int dx0 = a0 - sx[j], dx1 = a1 - sx[j], dy0 = b0 - sy[j],
                dy1 = b1 - sy[j];
            if (best > dx0 * dx0 + dy0 * dy0 + dx1 * dx1 + dy1 * dy1) {
                best = dx0 * dx0 + dy0 * dy0 + dx1 * dx1 + dy1 * dy1;
                best_idx = j;
            }
        }
        if (best_idx != -1) {
            t.push_back(2);
            r.push_back(best_idx + 1);
        }
    }
    t.push_back(1);
    r.push_back(1);

    int v = t.size();
    cout << v << endl;
    for (int i = 0; i < v; i++) {
        cout << t[i] << ' ' << r[i] << endl;
    }
    return 0;
}