#include <iostream>
#define MAX 31
#define INF 0x7ffffff
#define Source 3
#define Destination 4
#define Stone 2
#define Lily 1
#define Water 0
using namespace std;
 
typedef struct
{
	int x,y;
}point;
 
class tQueue
{
public:
	class linklist
	{
	public:
		linklist* next;
		point value;
		linklist()
		{
			next=0;
		}
	};
	linklist *first,*last;
	int size;
	bool inq[MAX][MAX];
	void add(point p)
	{
		if (inq[p.x][p.y])
			return;
		inq[p.x][p.y]=true;
		if (size==0)
			first=last=new linklist;
		else
			last=last->next=new linklist;
		last->value=p;
		size++;
	}
	point del()
	{
		point rtn=first->value;
		inq[rtn.x][rtn.y]=false;
		linklist *tfirst=first;
		first=first->next;
		delete tfirst;
		size--;
		return rtn;
	}
	void reset()
	{
		size=0;
		first=last=0;
	}
	tQueue()
	{
		reset();
	}
};
 
class gird
{
public:
	int m;
	int lily,skip;
	long long cnt;
	gird()
	{
		lily=skip=INF;
		cnt=0;
	}
};
 
int N,M;
gird G[MAX][MAX];
int dx[8]={-2,-1,1,2,2,1,-1,-2},dy[8]={1,2,2,1,-1,-2,-2,-1};
point S,T;
tQueue Q;
 
void init()
{
	int i,j,c;
	freopen("silvlily.in","r",stdin);
	freopen("silvlily.out","w",stdout);
	scanf("%d%d",&N,&M);
	for (i=1;i<=N;i++)
	{
		for (j=1;j<=M;j++)
		{
			scanf("%d",&c);
			G[i][j].m=c;
			if (c==Source)
			{
				S.x=i;S.y=j;
				G[S.x][S.y].cnt=1;
				G[S.x][S.y].lily=G[S.x][S.y].skip=0;
			}
			else if (c==Destination)
			{
				T.x=i;T.y=j;
			}
		}
	}
}
 
inline bool inrange(point p)
{
	return p.x>=1 && p.x<=N && p.y>=1 && p.y<=M;
}
 
void update(point p,int lily,int skip,long long cnt)
{
	if (lily<G[p.x][p.y].lily)
	{
		G[p.x][p.y].lily=lily;
		G[p.x][p.y].skip=skip;
		G[p.x][p.y].cnt=cnt;
		Q.add(p);
	}
	else if (lily==G[p.x][p.y].lily && skip<G[p.x][p.y].skip)
	{
		G[p.x][p.y].skip=skip;
		G[p.x][p.y].cnt=cnt;
		Q.add(p);
	}
	else if (lily==G[p.x][p.y].lily && skip==G[p.x][p.y].skip)
	{
		G[p.x][p.y].cnt+=cnt;
	}
}
 
void bfs()
{
	point i,j;
	int k,sp;
	Q.add(S);
	while (Q.size)
	{
		i=Q.del();
		for (k=0;k<8;k++)
		{
			j.x=i.x+dx[k];j.y=i.y+dy[k];
			if (inrange(j))
			{
				sp=G[i.x][i.y].lily;
				if (G[j.x][j.y].m==Stone) continue;
				if (G[j.x][j.y].m==Water)
					sp++;
				update(j,sp,G[i.x][i.y].skip+1,G[i.x][i.y].cnt);
			}
		}
	}
}
 
 
int main()
{
	init();
	bfs();
	if (G[T.x][T.y].lily==INF)
		cout << -1 << endl;
	else
		cout
			<< G[T.x][T.y].lily << endl
			<< G[T.x][T.y].skip << endl
			<< G[T.x][T.y].cnt << endl;
	return 0;
}