Introduction - If you have any usage issues, please Google them yourself
Given a maze of N*M size. The labyrinth is composed of channels and walls, and each step can move to the adjacent, upper and lower channels. The minimum number of steps required from the starting point to the end is requested.