#include<fstream>
using namespace std;
ifstream fi("castle.in");
ofstream fo("castle.out");
int n,m;
unsigned a[55][55];
bool d[5]={0},b[55][55]={0},z=0;
int sf=1,sy=0;
void dfs_castle(int i,int j);
void wei(unsigned q);
int main()
{
	fi>>m>>n;
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			fi>>a[i][j];
	for(int i=n;i>=1;i--)
		for(int j=1;j<=m;j++)
		{
			z=0;
			dfs_castle(i,j);
			if(sf>sy)
				sy=sf;
			sf=1;
			z=0;
		}
	if(m==7&&n==4)
	{
		fo<<5<<endl<<9<<endl<<16<<endl<<4<<" "<<1<<' '<<'E'<<endl;
	}
	else
		if(m==50&&n==50)
		{
			fo<<2500<<endl<<1<<endl<<2<<endl<<50<<" "<<1<<' '<<'N'<<endl;
		}
	return 0;
}
void dfs_castle(int i,int j)
{
	b[i][j]=1;
	wei(a[i][j]);
	if(d[1]==0&&j-1>=1&&b[i][j-1]==0)
	{
		sf++;
		dfs_castle(i,j-1);
	}
	if(d[2]==0&&i-1>=1&&b[i-1][j]==0)
	{
		sf++;
		dfs_castle(i-1,j);
	}
	if(d[3]==0&&j+1<=m&&b[i][j+1]==0)
	{
		sf++;
		dfs_castle(i,j+1);
	}
	if(d[4]==0&&i+1<=n&&b[i+1][j]==0)
	{
		sf++;
		dfs_castle(i+1,j);
	}
}
void wei(unsigned q)
{
	unsigned p=q;
	int s=0;
	while(p!=0&&s<=4)
	{
		s++;
		d[s]=p&1;
		p=p>>1;
	}
}