while True: try: m,n=list(map(int , input().split())) maze=[] for _ in range(m): maze.append(list(map(int,input().split()))) def walk(i, j, pos=[(0, 0)]): if j+1 < n and maze[i][j+1] == 0: # 向右 ...
