Problem statement

There is a town with a size of H in the north-south direction and W in the east-west direction. In the town, square plots with a side length of 1 are maintained without gaps, and one house is built in each plot.

A typhoon broke out over a section of the town, causing damage and then changing to an extratropical cyclone over a section. No damage is done after the change. As shown in the figure below, a typhoon is a square with a height of 3 and a width of 3, and the square with a star is called the center. The typhoon moves to the vicinity of 8 in units of sections. In other words, the center of the typhoon moves with the whole so that it moves to the section that shares the sides or vertices (including the current section). However, the typhoon does not protrude outside the town, and the center of the typhoon is the 0th and H-1st sections from the north and the 0th and W-1st sections from the west, as shown in the shaded area in the figure below. Move so that it does not pass.

<image>

Once a typhoon hits the sky, the degree of damage to the house changes as follows.

> No damage → Partially damaged → Half destroyed → Completely destroyed → No trace

Fortunately, however, there seems to be no house that has become a trace pear. Since the damage situation of each house is given, find the point where the typhoon occurred and the point where it changed to an extratropical cyclone. However, if the generated section is s_ith from the north, s_jth from the west, and the section changed to an extratropical cyclone is t_ith from the north and t_jth from the west, the two points are 10000 t_i + t_j ≤ 10000 s_i + s_j. Determined to meet.

input


H \ W
D_ {11} \… \ D_ {1W}
D_ {21} \… \ D_ {2W}
...
D_ {H1} \… \ D_ {HW}


D_ {ij} is an integer that expresses the degree of damage to the i-th house from the north and the j-th house from the west as follows.

* 0: No damage
* 1: Partially damaged
* 2: Half destroyed
* 3: Completely destroyed



Constraint

* An integer
* Input is given only if the answer is uniquely determined
* 3 ≤ H, W ≤ 500
* 0 ≤ D_ {ij} ≤ 3



output

Output the answer in one line as follows.


s_i \ s_j \ t_i \ t_j


sample

Sample input 1


7 5
0 0 0 0 0
0 1 1 1 0
0 2 2 2 0
0 3 3 3 0
0 2 2 2 0
0 1 1 1 0
0 0 0 0 0


Sample output 1


4 2 2 2


Sample input 2


6 6
0 0 0 1 1 1
0 0 0 2 2 2
0 0 1 3 3 2
1 2 3 3 2 1
1 2 3 2 1 0
1 2 2 1 0 0


Sample output 2


4 1 1 4


Sample input 3


4 4
2 2 2 0
2 2 2 0
2 2 2 0
0 0 0 0


Sample output 3


1 1 1 1






Example

Input

7 5
0 0 0 0 0
0 1 1 1 0
0 2 2 2 0
0 3 3 3 0
0 2 2 2 0
0 1 1 1 0
0 0 0 0 0


Output

4 2 2 2
#include <bits/stdc++.h>
using namespace std;
const int dx[] = {-1, 0, 1, 0, -1, -1, 1, 1};
const int dy[] = {0, -1, 0, 1, -1, 1, -1, 1};
vector<int> up = {0, 4, 5};
using Tp = tuple<int, int>;
int h, w;
int d[500][500];
int dist[500][500];
void bfs(int sx, int sy) {
  fill_n(*dist, 500 * 500, -9999);
  queue<Tp> q;
  dist[sx][sy] = 0;
  q.push(Tp(sx, sy));
  for (; q.size();) {
    int x, y;
    tie(x, y) = q.front();
    q.pop();
    for (int dir = 0; dir < 8; dir++) {
      int nx = x + dx[dir];
      int ny = y + dy[dir];
      if (nx < 0 || ny < 0 || nx >= h || ny >= w) continue;
      if (d[nx][ny] == 0) continue;
      if (dist[nx][ny] != -9999) continue;
      dist[nx][ny] = dist[x][y] + 1;
      q.push(Tp(nx, ny));
    }
  }
}
int main() {
  scanf("%d %d", &h, &w);
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      scanf("%d", &d[i][j]);
    }
  }
  int tx, ty;
  for (int i = 1; i + 1 < h; i++) {
    for (int j = 1; j + 1 < w; j++) {
      int t = 9999;
      for (int dir : up) {
        int nx = i + dx[dir];
        int ny = j + dy[dir];
        t = min(t, d[nx][ny]);
      }
      for (int dir = 0; dir < 8; dir++) {
        int nx = i + dx[dir];
        int ny = j + dy[dir];
        d[nx][ny] -= t;
      }
      if (t != 0) {
        tx = i;
        ty = j;
      }
    }
  }
  bfs(tx, ty);
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      if (dist[i][j] > dist[tx][ty]) {
        tx = i;
        ty = j;
      }
    }
  }
  bfs(tx, ty);
  int sx = 0, sy = 0;
  for (int i = 0; i < h; i++) {
    for (int j = 0; j < w; j++) {
      if (dist[i][j] > dist[sx][sy]) {
        sx = i;
        sy = j;
      }
    }
  }
  if (Tp(sx, sy) < Tp(tx, ty)) {
    swap(sx, tx);
    swap(sy, ty);
  }
  printf("%d %d %d %d\n", sx, sy, tx, ty);
}
