Chef and the Cheese

Chef wants to prepare a delicious dish with cheese. To get the cheese chef needs to pass through the maze and reach its last column. A maze is a N*(M+2) binary matrix of blocks where source block is any block in the first column i.e., maze[i][1] and the destination is to reach last column i.e., maze[i][M+2] where i is from 1 to N. Chef can only move forward. In the maze matrix, 0 means blocked ce