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

int main() {
  int n, k;
  cin >> n >> k;
  vector<string> d(n);
  for (auto &row : d) cin >> row;

  // 累積和 S[i][j] = d[0..i-1][0..j-1] の総和
  vector<vector<long long>> S(n + 1, vector<long long>(n + 1, 0));
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++) S[i + 1][j + 1] = S[i][j + 1] + S[i + 1][j] - S[i][j] + (d[i][j] - '0');
  auto rect = [&](int i0, int i1, int j0, int j1) {  // 行 [i0,i1) 列 [j0,j1)
    return S[i1][j1] - S[i0][j1] - S[i1][j0] + S[i0][j0];
  };

  long long bestVar = LLONG_MAX;
  int bestDist = INT_MAX, bestH = -1, bestW = -1;
  bool tie = false;
  for (int h = 2; h <= n - 1; h++) {
    for (int w = 2; w <= n - 1; w++) {
      int r = h - 1, c = w - 1;  // 0-indexed の切る行・列
      long long D[4] = {rect(0, r, 0, c), rect(0, r, c + 1, n), rect(r + 1, n, 0, c), rect(r + 1, n, c + 1, n)};
      long long sum = 0, sq = 0;
      for (long long x : D) sum += x, sq += x * x;
      long long var = 4 * sq - sum * sum;
      int dist = abs(h - 25) + abs(w - 25);
      if (var < bestVar || (var == bestVar && dist < bestDist)) {
        bestVar = var, bestDist = dist, bestH = h, bestW = w;
        tie = false;
      } else if (var == bestVar && dist == bestDist) {
        tie = true;
      }
    }
  }
  (void)tie;
#ifdef LOCAL
  if (tie) fprintf(stderr, "TIE h=%d w=%d var=%lld dist=%d\n", bestH, bestW, bestVar, bestDist);
  fprintf(stderr, "h=%d w=%d var12=%lld\n", bestH, bestW, bestVar);
#endif

  int r = bestH - 1, c = bestW - 1;
  vector<pair<int, int>> cuts;
  for (int i = 0; i < n; i++)
    for (int j = 0; j < n; j++)
      if ((i == r || j == c) && d[i][j] != '0') cuts.emplace_back(i, j);
  printf("%d\n", (int)cuts.size());
  for (auto [i, j] : cuts) printf("%d %d\n", i, j);
}