#include<bits/stdc++.h>
using namespace std;
int dx[] = {0, -1, 0, 1}, dy[] = {-1, 0, 1, 0};
int n, m, c, v, c1, v1, migong[1005][1005], temp, w = 1;
struct node {
	int x, y;
} a[100005];
void print(int n) {
	for (int i = 1; i <= n; i++) {
		if (i != n)  printf("(%d,%d)->", a[i].x, a[i].y);
		else  printf("(%d,%d)\n", a[i].x, a[i].y);
	}
}
void dfs(int x, int y) {
	if (x == c1 && y == v1) {
		temp++;
		print(w);
		return ;
	}
	for (int i = 0; i < 4; i++) {
		int xx = x + dx[i], yy = y + dy[i];
		if (xx >= 1 && xx <= n && yy >= 1 && yy <= m && migong[xx][yy] == 1) {
			migong[xx][yy] = 0;
			w++;
			a[w].x = xx;
			a[w].y = yy;
			dfs(xx, yy);
			w--;
			migong[xx][yy] = 1;
		}
	}
}
int main() {

	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++) {
		for (int j = 1; j <= m; j++) {
			scanf("%d", &migong[i][j]);
		}
	}
	scanf("%d%d%d%d", &c, &v, &c1, &v1);
	a[1].x = c, a[1].y = v;
	dfs(c, v);
	if (temp == 0)  printf("-1");

	return 0;
}

WA 35pts