#include<bits/stdc++.h>
using namespace std;
#define pr pair<int,int>
const int N=20;
int bex,bey,enx,eny,n,m;
int dis[N][N],vis[N][N];
pr dp[N*N];
int tot;
int u;
void dfs(int x,int y){
	if(x==enx&&y==eny){
		u=1;
		cout<<"("<<bex<<","<<bey<<")->"; 
		for(int i=1;i<=tot-1;i++){
			cout<<"("<<dp[i].first<<","<<dp[i].second<<")->"; 
		} 
		cout<<"("<<dp[tot].first<<","<<dp[tot].second<<")"<<endl;
	}else{		
		if(y>1&&vis[x][y-1]){
			tot++;
			dp[tot].first=x,dp[tot].second=y-1;
			vis[x][y-1]=0;
			dfs(x,y-1);
			vis[x][y-1]=1;
			tot--;
		}
		if(x>1&&vis[x-1][y]){
			tot++;
			dp[tot].first=x-1,dp[tot].second=y;
			vis[x-1][y]=0;
			dfs(x-1,y);
			vis[x-1][y]=1;
			tot--;	
		}	
		if(y<n&&vis[x][y+1]){
			tot++;
			dp[tot].first=x,dp[tot].second=y+1;
			vis[x][y+1]=0;
			dfs(x,y+1);
			vis[x][y+1]=1;
			tot--;
		}
		if(x<m&&vis[x+1][y]){
			tot++;
			dp[tot].first=x+1,dp[tot].second=y;
			vis[x+1][y]=0;
			dfs(x+1,y);
			vis[x+1][y]=1;
			tot--;
		}
	

	
		
			
	}
}
int main(){
	cin>>m>>n;
	for(int i=1;i<=m;i++){
		for(int j=1;j<=n;j++){
			cin>>vis[i][j];
		}
	}
	vis[1][1]=0;
	cin>>bex>>bey;
	cin>>enx>>eny;
	dfs(bex,bey);
	if(u==0){
		cout<<-1<<endl;
	}
	return 0;
}