#include<iostream>
#include<cstring>
#include<queue>
using namespace std;
typedef pair<int, int> PII;
const int N = 110;
int g[N][N], d[N][N];
queue<PII> q;
int n, m;

void bfs(int a, int b) {
    d[0][0] = d[1][1] = 0;
    q.push({a, b});
    while(!q.empty()) {
        PII start = q.front();
        q.pop();
        int dx[4] = {1, -1, 0, 0};
        int dy[4] = {0, 0, 1, -1};
        for (int i = 0; i < 4; i ++ ) {
            int x = start.first + dx[i], y = start.second + dy[i];
            if (g[x][y] == 0) {
                g[x][y] = 1;
                d[x][y] = d[start.first][start.second] + 1;
                q.push({x, y});
            }
        }
    }
    cout << d[n][m];
}

int main() {
    cin >> n >> m;
    memset(g, 1, sizeof g);
    for (int i = 1; i <= n; i ++ ) {
        for (int j = 1; j <= m; j ++ ) cin >> g[i][j];
    }
    bfs(1, 1);
    return 0;
}