Paku Paku and Shortest Path

You are inside an NxM maze which you have to exit. Also, let us name this maze “IIIT D” and the exit “graduation”. You have to calculate, given a maze, the minimum number of steps you need to take from the starting point to reach the exit. If the exit is unreachable from the starting point, print ­1 Input First line contains 2 integers : N and M. Each of the next N lines contain M characte