Maze Runner

Chef and Chefina are trapped in a magical maze of dimensions $N$ x $M$ x $K$. Each cell of the maze contains a non-negative integer. They are currently at $(1, 1, 1)$ and need to reach $(N, M, K)$ to escape. In $1$ move, they can go $1$ cell either to the right, down or to the bottom. More formally, if they are at cell ($x$, $y$, $z$), in one move they can go to : $(x+1,y,z)$ or $(x, y+1,z)$ or $