Maze Problem

Given a maze composed of several rows and columns, where '0' represents a walkable path and '1' represents a wall. Your task is to find a feasible path from the starting point to the ending point with the shortest path approach. Output the path traversed. If there is no feasible path, output 'No Path'. Note: The start and end points lie on the maze's boundary and are valid start points. Assume the maze size is n x m (1 <= n, m <= 100). Provide the starting and ending coordinates, and output the path coordinates. Example Input 4 4 0 0 1 0 1 0 1 1 1 0 0 0 1 0 0 1 1 0 0 0 3 3