#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> PII;

const int N = 110;

int g[N][N],  d[N][N];
int n, m;

int bfs(){
    queue<PII> q;

    memset(d, -1, sizeof d);

    d[0][0] = 0;
    q.push({0, 0});
    vector<PII> directions = {{0, 1}, {0, -1}, {-1, 0}, {1, 0}};


    while(q.size()){
        auto t = q.front();
        q.pop();



        for(int i = 0; i < 4; i ++){
            int x = t.first + directions[i].first, y = t.second + directions[i].second;
            if(x >= 0 && x < n && y >= 0 && y < m && d[x][y] == -1 && g[x][y] == 0){
                q.push({x, y});
                d[x][y] = d[t.first][t.second] + 1;
            }
        }
    }


    return d[n - 1][m - 1];
}

int main(){
    cin >> n >> m;

    for(int i = 0; i < n; i ++){
        for(int j = 0; j < m; j ++){
            cin >> g[i][j];
        }
    }


    cout << bfs() << endl;

    return 0;
}