#include<bits/stdc++.h>
using namespace std;
bool vis[1000+5][1000+5];
int a[1000+5][1000+5];
int dir[4][2]={0,1,0,-1,1,0,-1,0};
int n,m;
struct node
{
	int x,y,step;
};
int BFS()
{
	queue<node>Q;
	Q.push({1,1,0});
	vis[1][1]=true;
	while(Q.size())
	{
		node front=Q.front();
		Q.pop();
		if(front.x==n&&front.y==m)
			return front.step;
		for(int i=0;i<4;i++)
		{
			int dx=front.x+dir[i][0]*a[front.x][front.y],dy=front.y+dir[i][1]*a[front.x][front.y];
			if(dx>=1&&dx<=n&&dy>=1&&dy<=m&&!vis[dx][dy])
			{
				vis[dx][dy]=true;
				Q.push({dx,dy,front.step+1});
			}	
		}		
	}
	return -1;
}
int main()
{
	memset(vis,false,sizeof(vis));
	scanf("%d %d",&n,&m);
	for(int i=1;i<=n;i++)
		for(int j=1;j<=m;j++)
			scanf("%d",&a[i][j]);
	int ans=BFS();
	if(ans==-1)
		cout<<"No Solution";
	else
		cout<<ans;
	return 0;
}