//#pragma GCC target("avx2")
//#pragma GCC optimize("O3")
//#pragma GCC optimize("unroll-loops")
#include <iostream>
#include <iomanip>
#include <algorithm>
#include <vector>
#include <string>
#include <set>
#include <map>
#include <cassert>
#include <cmath>
#include <tuple>
#include <queue>
#include <bitset>
using namespace std;
using lg = long long;
#define TEST clog << "TEST" << endl
#define IINF 2147483647
#define LLINF 9223372036854775807LL
#define AMARI 998244353
#define TEMOTO ((sizeof(long double) == 16) ? false : true)
#define TIME_LIMIT 980 * (TEMOTO ? 1 : 1000)
#define el '\n'
#define El '\n'

int wakusei_num, station_num;

class planet {
public:
    int x;
    int y;
    int num;
};

class station {
public:
    int x;
    int y;
    int num;
};

#define MULTI_TEST_CASE false
void solve(void) {
    cin >> wakusei_num >> station_num;
    vector<planet> wakusei(wakusei_num);
    for (int i = 0; i < wakusei_num; i++) {
        cin >> wakusei[i].x >> wakusei[i].y;
    }
    for (int i = 0; i < station_num; i++) {
        cout << "0 0" << El;
    }
    cout << wakusei_num + 1 << el;
    for (int i = 0; i < wakusei_num; i++) {
        cout << 1 << ' ' << i + 1 << el;
    }
    cout << "1 1" << el;
    return;
}

void calc(void) {
    return;
}

int main(void) {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int t = 1;
    if (MULTI_TEST_CASE)cin >> t;
    while (t--) {
        solve();
    }
    calc();
    return 0;
}