#include <bits/stdc++.h>
#pragma GCC optimize(2)
using namespace std;
#define int long long
//fixed << setprecision()
const int length = 1005;
int n, m;
int arr[length][length];


struct node
{
	int x,y;
	int step;	
};
int dir[4][2] = {
			{-1,  0},
{ 0, -1},              { 0,  1},
            { 1,  0}
};


int bfs(int si, int sj, int ei, int ej)
{
	bool vis[length][length];
	memset(vis, 0, sizeof vis);
	queue<node> q; 
	q.push({si, sj, 0});
	vis[si][sj] = true;
	while(q.size())
	{
		auto ccc = q.front();
		q.pop();
		if(ccc.x == ei && ccc.y == ej)
		{
			return ccc.step; 
		}
		for(int i = 0;i < 4;i++) 
		{
			int nx = ccc.x + dir[i][0] * arr[ccc.x][ccc.y];
			int ny = ccc.y + dir[i][1] * arr[ccc.x][ccc.y];
			if(1 <= nx && nx <= n && 1 <= ny && ny <= m)
			{
				if(!vis[nx][ny])
				{
					vis[nx][ny] = true;
					q.push({nx, ny, ccc.step + 1});
				}
			}
		}
	}
	
	return -1;
}


signed main()
{
	ios::sync_with_stdio(false);
	cin >> n >> m;
	for(int i = 1;i <= n;i++)
	{
		for(int j = 1;j <= m;j++)
		{
			cin >> arr[i][j];
		}
	}
	int ans = bfs(1, 1, n, m);
	 
	 
	if(ans != -1)
		cout << ans << endl;
	else
		cout << "No Solution" << endl;
	return 0;
}