#include<bits/stdc++.h>
using namespace std;
int n,t;
int a[20][20];
int eval_path(vector<pair<int,int>> path){
  int sum=0;
  for(auto [i,j]:path) sum+=a[i][j];
  return sum;
}
void print(vector<pair<int,int>> path){
  cout<<path.size()<<endl;
  for(auto [i,j]:path) cout<<i<<" "<<j<<endl;
}
vector<pair<int,int>> simple(){
  vector<pair<int, int>> path;

    for (int i = 0; i < n; i++) {
        if (i % 2 == 0) {
            // 左から右へ
            for (int j = 0; j < n; j++) {
                path.push_back(make_pair(i, j));
                if (path.size() == t) {
                    break;
                }
            }
        } else {
            // 右から左へ
            for (int j = n - 1; j >= 0; j--) {
                path.push_back(make_pair(i, j));
                if (path.size() == t) {
                    break;
                }
            }
        }

        if (path.size() == t) {
            break;
        }
    }
    return path;
}
int main(){
  cin>>n>>t;
  for(int i=0;i<n;i++) for(int j=0;j<n;j++) cin>>a[i][j];
  int l=(t+n-1)/n;
  auto ans=simple();
  int sc_max=eval_path(ans);
  for(int i=0;i<n+1-l;i++){
    auto q=simple();
    for(auto& [a,b]:q) a+=i;
    if(sc_max<eval_path(q)){
      sc_max=eval_path(q);
      ans=q;
    }
  }
  for(int i=0;i<n+1-l;i++){
    auto q=simple();
    for(auto& [a,b]:q){
      swap(a,b);
      b+=i;
    }
    if(sc_max<eval_path(q)){
      sc_max=eval_path(q);
      ans=q;
    }
  }
  print(ans);
}