#include <iostream>

#include <cstdio>

#include <cmath>

#include <algorithm>

#include <vector>

#include <iomanip>

#include <cstring>

#include <map>

#include <queue>

#include <set>

#include <cassert>

#include <stack>

#define mkp make_pair

using namespace std;

const double EPS=1e-;

typedef long long lon;

const lon SZ=,INF=0x7FFFFFFF;

int n,m,arr[SZ][SZ],dx[]={,-,,},dy[]={-,,,};

bool vst[SZ][SZ];

struct nd{

    int x,y;

    nd(int a,int b):x(a),y(b){}

};

void init()

{

    cin>>m>>n;

    for(int i=;i<=n;++i)

    {

        for(int j=;j<=m;++j)cin>>arr[i][j];

    }

}

int bfs(int bgx,int bgy)

{

    int res=;

    queue<nd> q;

    vst[bgx][bgy]=;

    q.push(nd(bgx,bgy));

    for(;!q.empty();)

    {

        nd frt=q.front();

        q.pop();

        for(int i=;i<;++i)

        {

            int nx=frt.x+dx[i],ny=frt.y+dy[i];

            if(!(arr[frt.x][frt.y]&(<<i))&&nx>=&&nx<=n&&ny>=&&ny<=m&&!vst[nx][ny])

            {

                vst[nx][ny]=;

                q.push(nd(nx,ny));

                ++res;

            }

        }

    }

    return res;

}

void work(int &block,int &maxb)

{

    block=;

    maxb=;

    for(int i=;i<=n;++i)

    {

        for(int j=;j<=m;++j)

        {

            if(!vst[i][j])

            {

                maxb=max(maxb,bfs(i,j));

                ++block;

            }

        }

    }

}

void work2(int &maxv,int &maxx,int &maxy,char &maxd)

{

    maxv=;

    for(int j=;j<=m;++j)

    {

        for(int i=n;i>=;--i)

        {

            if(arr[i][j]&)

            {

                memset(vst,,sizeof(vst));

                arr[i][j]-=;

                int cur=bfs(i,j);

                if(cur>maxv)

                {

                    maxv=cur;

                    maxx=i,maxy=j;

                    maxd='N';

                }

                arr[i][j]+=;

            }

        }

        for(int i=n;i>=;--i)

        {

            if(arr[i][j]&)

            {

                memset(vst,,sizeof(vst));

                arr[i][j]-=;

                int cur=bfs(i,j);

                if(cur>maxv)

                {

                    maxv=cur;

                    maxx=i,maxy=j;

                    maxd='E';

                }

                arr[i][j]+=;

            }

        }

    }

}

int main()

{

    std::ios::sync_with_stdio();

    //freopen("d:\\1.txt","r",stdin);

    lon casenum;

    //cin>>casenum;

    //for(lon time=1;time<=casenum;++time)

    {

        init();

        int block,maxb;

        work(block,maxb);

        cout<<block<<endl;

        cout<<maxb<<endl;

        int maxv,maxx,maxy;

        char maxd;

        work2(maxv,maxx,maxy,maxd);

        cout<<maxv<<endl;

        cout<<maxx<<" "<<maxy<<" "<<maxd<<endl;

    }

    return ;

}