#include<fstream>
#include<cstring>
#define N 1005
using namespace std;
ifstream fin("terencasa_low.in");
ofstream fout("terencasa_low.out");

int  a[N][N], s[N][N];
int n,m,l1,c1,l2,c2, Max=1, S;
int i,j;
bool Test(int i1, int i2, int j1, int j2)
{
    S=s[i2][j2]-s[i1-1][j2]-s[i2][j1-1]+s[i1-1][j1-1];
    if(S==(i2-i1+1)*(j2-j1+1)) return 1;
    return 0;
}
int main()
{
 ///citire
 fin>>n>>m;
 for(i=1;i<=n;i++)
    for(j=1;j<=m;j++)
 {
     fin>>a[i][j];
     s[i][j]=s[i-1][j]+s[i][j-1]-s[i-1][j-1]+a[i][j];
 }

 for(int i1=1;i1<n;i1++)
    for(int j1=1;j1<m;j1++)
        for(int i2=i1+Max,j2=j1+Max;i2<=n && j2<=m; i2++, j2++)
           if(Test(i1, i2, j1, j2))
        {
            if(i2-i1+1> Max)
            {
                Max=i2-i1+1;
                l1=i1, l2=i2, c1=j1, c2=j2;
            }
        }
        else break;
  fout<<Max<<"\n"<<l1<<" "<<c1<<" "<<l2<<" "<<c2;
  return 0;
}