from typing import *

def findPath(graph: List[List[int]], start: tuple, end: tuple) -> List[int]:
    # graph: 0表示可行位置，-1表示障碍
    m, n, queue = len(graph), len(graph[0]), [start]
    mark = [[False for _ in range(n)] for _ in range(m)]
    mark[start[0]][start[1]] = True
    while len(queue) > 0:
        cur_x, cur_y = queue.pop()
        for nxt in [(cur_x - 1, cur_y), (cur_x + 1, cur_y), (cur_x, cur_y - 1), (cur_x, cur_y + 1)]:
            if 0<=nxt[0]<m and 0<=nxt[1]<n and 

