#include <iostream> // cout, endl, cin
#include <string> // string, to_string, stoi
#include <vector> // vector
#include <algorithm> // min, max, swap, sort, reverse, lower_bound, upper_bound
#include <utility> // pair, make_pair
#include <tuple> // tuple, make_tuple
#include <cstdint> // int64_t, int*_t
#include <cstdio> // printf
#include <map> // map
#include <queue> // queue, priority_queue
#include <set> // set
#include <stack> // stack
#include <deque> // deque
#include <unordered_map> // unordered_map
#include <unordered_set> // unordered_set
#include <bitset> // bitset
#include <cctype> // isupper, islower, isdigit, toupper, tolower
#include <iomanip>//fixed,setprecision
//#include <limits.n>//INT_MAX
//#include <math.n>//M_PI
#include <random>
#include <regex> // 正規表現
#include <time.h>
//#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define rep(i, n) for (ll i = 0; i < (ll)(n); i++)
const int n=100;
const int m=8;
class terry_yukico{
    public:
    int sx,sy;
    vector<pair<int,int>>x,y;

    void input();
    void output();
};
void terry_yukico::input(){
    int ni,mi;
    cin>>ni>>mi;
    int a,b;
    //cin>>sx>>sy;
    rep(i,n){
        cin>>a>>b;
        x.emplace_back(a,i+1);
        y.emplace_back(b,i+1);
    }
}
void terry_yukico::output(){
    rep(i,m){
        cout<<i+1<<" "<<i+1<<endl;
    }
    cout<<n+2<<endl;
    sort(x.begin(),x.end());
    cout<<1<<" "<<1<<endl;
    rep(i,n)cout<<1<<" "<<x[i].second<<endl;
    cout<<1<<" "<<1<<endl;
}
int main(){
    terry_yukico state;
    state.input();
    state.output();
    return 0;
}