#include <bits/stdc++.h>
using namespace std;
struct Node
{
    int x, y;
};
int n, m, a[1005][1005], vis[1005][1005];
int X[3] = {0, 1, -1};
bool check(int x, int y)
{
    return 1 <= x && x <= n && 1 <= y && y <= m;
}
void bfs()
{
    queue<Node> q;
    q.push({1, 1});
    memset(vis, -1, sizeof vis);
    vis[1][1] = 0;
    while (!q.empty())
    {
        int fx = q.front().x, fy = q.front().y;
        q.pop();
        //cout << fx << " " << fy << endl;
        for (int i = 1; i <= 2; ++i)
        {
            int u = fx + X[i] * a[fx][fy], v = fy;
            if (check(u, v) && vis[u][v] == -1)
            {
                q.push({u, v});
                vis[u][v] = vis[fx][fy] + 1;
            }
        }
        for (int i = 1; i <= 2; ++i)
        {
            int u = fx, v = fy + X[i] * a[fx][fy];
            if (check(u, v) && vis[u][v] == -1)
            {
                q.push({u, v});
                vis[u][v] = vis[fx][fy] + 1;
            }
        }
    }
}
int main()
{
    cin >> n >> m;
    for (int i = 1; i <= n; ++i)
    {
        for (int j = 1; j <= m; ++j)
        {
            cin >> a[i][j];
        }
    }
    bfs();
    if (vis[n][m] == -1) cout << "No Solution" << endl;
    else cout << vis[n][m] << endl;
    return 0;
}