求救 样例多个（2，6）->

#include<iostream>
using namespace std;

const int N = 110;
int dx[4] = {-1, 1, 0, 0};
int dy[4] = {0, 0, -1, 1};
int grid[N][N];
bool vis[N][N] = {false};
int n, m;
bool ok = false;
void dfs(int x, int y) {
	if (ok) return;

	if (x == n - 1 && y == m - 1) {
		ok = true;
		return;
	}

	for (int i = 0; i < 4; i++) {
		int nx = x + dx[i];
		int ny = y + dy[i];
		if (nx >= 0 && nx < n && ny >= 0 && ny < m && grid[nx][ny] == 1 && !vis[nx][ny]) {
			vis[nx][ny] = true;
			if (x != n - 1 && y != m - 1) {
				cout << "(" << nx + 1 << "," << ny + 1 << ")->";
			} else {
				cout << "(" << nx + 1 << "," << ny + 1 << ")";
			}
			dfs(nx, ny);
		}
	}
}

int main() {
	cin >> n >> m;
	for (int i = 0; i < n; i++) {
		for (int j = 0; j < m; j++) {
			cin >> grid[i][j];
		}
	}
	int x1, y1, x2, y2;
	cin >> x1 >> y1 >> x2 >> y2;
	cout << "(1,1)->";
	vis[0][0] = true;
	dfs(0, 0);
	return 0;
}