#include <bits/stdc++.h>
using namespace std;
#pragma GCC optimize(2)
typedef long long LL;
int n,m,arr[1005][1005],dir[4][2]={
{1,0},
{0,1},
{-1,0},
{0,-1}
};
bool vis[1005][1005];
struct nd{
    int x,y,dis;
};
bool B(int x,int y){return ((x>=1)&&(x<=n)&&(y>=1)&&(y<=m));}
int bfs(int x,int y){
    vis[x][y]=1;
    queue<nd> apple;
    apple.push({x,y,0});
    nd cur;
    int tx,ty;
    while (!apple.empty()){
        cur=apple.front();apple.pop();
        if ((cur.x==n)&&(cur.y==m)){return cur.dis;}
        for (int i=0;i<4;++i){
            tx=cur.x+(dir[i][0]*arr[cur.x][cur.y]);
            ty=cur.y+(dir[i][1]*arr[cur.x][cur.y]);
            if (B(tx,ty)){if (!vis[tx][ty]){vis[tx][ty]=1;apple.push({tx,ty,cur.dis+1});}}
        }
    }
    return -1;
}
int main(){
    scanf("%d%d",&n,&m);
    for (int i=1;i<=n;++i){for (int j=1;j<=m;++j){scanf("%d",arr[i]+j);}}
    int ans=bfs(1,1);
    if (!(~ans)){puts("No Solution");return 0;}
    printf("%d",ans);
    return 0;
}