let n=readline().split(' ').map(Number),maze=[]//读数据 while(line=readline()) maze.push(line.split(' ').map(Number)) function find(i,j,road){ road.push([i,j]);//先推入0,0 maze[i][j]=1; if(i==n[0]-1 && j==n[1]-1){ for (let i of road) print(`(${i[0]},${i[1]})`); } if(j+1<n>= 0 && maze[i][j-1]==0) find(i,j-1,road.slice())//左 if(i-1 >= 0 && maze[i-1][j]==0) find(i-1,j,road.slice())//上 } find(0,0,[])</n>