Escape

Chef has lost himself once again. This time he finds himself in a $N \times N$ maze with initial position $(1, 1)$. His goal is to reach position $(N, N)$. To do this, he can move from cell $(x, y)$ to one of the following $4$ cells - $(x + 1, y)$, $(x - 1, y)$, $(x, y + 1)$, $(x, y - 1)$ (only if the destination cell exists within the grid). To make Chef's life harder, someone has blocked $M$ ce