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

typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

const long double EPS = 1e-10;
const long long INF = 1e18;
const long double PI = acos(-1.0L);

const double TIME_LIMIT = 0.95;

struct Planet {
    int a;
    int b;
    int idx;
    Planet(int _a, int _b, int _idx) {
        a = _a;
        b = _b;
        idx = _idx;
    }
    Planet(const Planet &old) {
        a = old.a;
        b = old.b;
        idx = old.idx;
    }
};

struct Station {
    int a;
    int b;
    int idx;
    Station(int _a, int _b, int _idx) {
        a = _a;
        b = _b;
        idx = _idx;
    }
    Station(const Station &old) {
        a = old.a;
        b = old.b;
        idx = old.idx;
    }
};

int N, M;
vector<Planet> planet;
vector<Station> station;
const int A = 5;
/*Target to minimize */
ll energy = 0;
Planet startPlanet(0,0,0);

bool PlanetComp(const Planet &left, const Planet &right) {
    ll la, lb, ra, rb;
    ll leftDist, rightDist;
    la = left.a;
    lb = left.b;
    leftDist = (la - startPlanet.a) * (la - startPlanet.a) + (lb - startPlanet.b) * (lb - startPlanet.b);
    ra = right.a;
    rb = right.b;
    rightDist = (ra - startPlanet.a) * (ra - startPlanet.a) + (rb - startPlanet.b) * (rb - startPlanet.b);
    return leftDist < rightDist;
};


void Input() {
    cin >> N >> M;
    for(int i = 0; i < N; i++) {
        int a, b;
        cin >> a >> b;
        Planet p(a, b, i + 1);
        planet.push_back(p);
    }
	startPlanet = planet[0];
    return;
}

void OutputStation() {
    for(int i = 0; i < M; i++) {
        cout << station[i].a << " " << station[i].b << endl;
    }
    return;
}

void OutputWayPoint(int type, int idx) { cout << type << " " << idx << endl; }

void OutputRoute() {
    int V = planet.size() + 1;
    cout << V << endl;
    OutputWayPoint(1, planet[0].idx);
    for(int i = 1; i < N; i++) {
        OutputWayPoint(1, planet[i].idx);
    }
    OutputWayPoint(1, planet[0].idx);

    return;
}

void solve() {
    for(int i = 1; i < M + 1; i++) {
        Station s(0, i, i);
        station.push_back(s);
    }
    sort(planet.begin(), planet.end(), PlanetComp);
    return;
}

int main() {
    Input();

    solve();

    OutputStation();
    OutputRoute();

    return 0;
}