Row Bombing

There is an $N \times M$ grid, with rows numbered $1$ to $N$ from top to bottom, and columns $1$ to $M$ from left to right. Chef starts at cell $(1, 1)$ and wants to reach cell $(N, M)$. However, some cells contain walls. Chef can move from their current cell to any adjacent cell (a cell which shares an edge) within the grid that does not contain a wall. So it may be possible initially that all o