5 5
0 1 0 0 0
0 1 0 1 0
0 0 0 0 0
0 1 1 1 0
0 0 0 1 0

#include <iostream>
#include <queue>
#include <cstring>

using namespace std;

const int N = 100;
typedef pair<int, int> PII;

int n, m;
int g[N][N];//存迷宫
int d[N][N];//存每个点到起点距离
queue<PII> q;
int dx[4] = {-1, 0, 1, 0}, dy[4] = {0, 1, 0, -1};
PII path[N][N];//记录最短路路径

int bfs() {
    q.push({0, 0});
    memset(d, -1, sizeof d);
    d[0][0] = 0;

    while(q.size()) {
        auto t = q.front();
        q.pop();
        for(int i = 0; i < 4; i ++) {
            int x = t.first + dx[i], y = t.second + dy[i];
            if(x >= 0 && x < n && y >= 0 && y < m && g[x][y] == 0 && d[x][y] == -1) {
                d[x][y] = d[t.first][t.second] + 1;
                path[x][y] = t;
                q.push({x, y});
            }
        }
    }

    int x = n - 1, y = m - 1;
    while(x || y) {
        cout <<x << " " << y << endl;
        auto t = path[x][y];
        x = t.first, y = t.second;
    }
    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;
}