#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

const int N = 100;
const int M = 8;

int main() {
  int _N, _M;
  cin >> _N >> _M;

  for (int i = 0; i < M; ++i) {
    int a, b;
    cin >> a >> b;
  }

  for (int i = 0; i < M; ++i) {
    cout << "0 0" << endl;
  }

  cout << N + 1 << endl;
  cout << "1 1" << endl;

  for (int i = 0; i < N - 1; ++i) {
    cout << "1 " << (i + 2) << endl;
  }

  cout << "1 1" << endl;

  return 0;
}