CF540C 踏冰块能否由起点踏入终点并把终点踏碎？

You play a computer game. Your character stands on some level of a multilevel ice cave. In order to move on forward, you need to descend one level lower and the only way to do this is to fall through the ice.

The level of the cave where you are is a rectangular square grid of n rows and m columns. Each cell consists either from intact or from cracked ice. From each cell you can move to cells that are side-adjacent with yours (due to some limitations of the game engine you cannot make jumps on the same place, i.e. jump from a cell to itself). If you move to the cell with cracked ice, then your character falls down through it and if you move to the cell with intact ice, then the ice on this cell becomes cracked.

Let's number the rows with integers from 1 to n from top to bottom and the columns with integers from 1 to m from left to right. Let's denote a cell on the intersection of the r-th row and the c-th column as (r, c).

You are staying in the cell (r1, c1) and this cell is cracked because you've just fallen here from a higher level. You need to fall down through the cell (r2, c2) since the exit to the next level is there. Can you do this?

Input

The first line contains two integers, n and m (1 ≤ n, m ≤ 500) — the number of rows and columns in the cave description.

Each of the next n lines describes the initial state of the level of the cave, each line consists of m characters "." (that is, intact ice) and "X" (cracked ice).

The next line contains two integers, r1 and c1 (1 ≤ r1 ≤ n, 1 ≤ c1 ≤ m) — your initial coordinates. It is guaranteed that the description of the cave contains character 'X' in cell (r1, c1), that is, the ice on the starting cell is initially cracked.

The next line contains two integers r2 and c2 (1 ≤ r2 ≤ n, 1 ≤ c2 ≤ m) — the coordinates of the cell through which you need to fall. The final cell may coincide with the starting one.

Output

If you can reach the destination, print 'YES', otherwise print 'NO'.

Examples

input

4 6
X...XX
...XX.
.X..X.
......
1 6
2 2

output

YES

input

5 4
.X..
...X
X.X.
....
.XX.
5 3
1 1

output

NO

input

4 7
..X.XX.
.XX..X.
X...X..
X......
2 2
1 6

output

YES

Note

In the first sample test one possible path is:

After the first visit of cell (2, 2) the ice on it cracks and when you step there for the second time, your character falls through the ice as intended.

这一题不难，但是必须看仔细题目以及想全情况。

题意（转自_大太阳_）：

n*m的地图，'X'表示有裂痕的冰块，'.'表示完整的冰块，有裂痕的冰块再被踩一次就会碎掉，完整的冰块被踩一次会变成有裂痕的冰块，

现在告诉起点和终点，问从起点能否走到终点并且使终点的冰块碎掉。不能原地跳。起点和终点可能会在同一个位置。

简单的来说，冰块有三个状态：①完好的('.')，②有裂痕还是完好的('X')，③碎裂的。从某个点踩过来时①->②，②->③。最终终点的冰块必须是碎裂的。

有几个需要特判的样例：

Input

1 1
X
1 1
1 1

Output

NO

Input

2 1
.
X
2 1
2 1

Output

YES

Input

2 2
..
XX
2 1
1 1

Output

YES

首先是起点终点位置一样的情况。虽然这个点已经是终点但你不能在原地蹦跳。所以是‘X'的话旁边需要有一个‘.'，是‘.'的话旁边需要有两个‘.'。

起点终点位置不一样的情况，是‘X'的话直接踏入终点，不需要考虑旁边有没有’.'；是‘.'的话旁边需要有两个‘.'。为什么这里是两个点？因为一个是从起点来的路，一个是让你由②变成③的。但是上面最后一个样例特殊，它一步直接到终点中间没有路。所以一开始需要把备用数组的起点由'X'处理成‘.'。这样就会有两个点了。

#include<bits/stdc++.h>
using namespace std;
int dx[4]={0,0,-1,1};int dy[4]={-1,1,0,0};
string x[505],y[505];
struct node{
	int a,b;
};
int main(){
	int n,m;
	cin>>n>>m;
	for(int i=0;i<n;++i){
		cin>>x[i];
		y[i]=x[i];
	}
	int a,b,c,d;
	cin>>a>>b;
	cin>>c>>d;
	a--;b--;c--;d--;
	y[a][b]='.'; //把备用数组的起点由'X'处理成‘.'
	if(a==c&&b==d){
		if(x[c][d]=='X'){
			int s=0;
			for(int i=0;i<4;++i){
				int ii=c+dx[i],jj=d+dy[i];
				if(ii<0||ii>=n||jj<0||jj>=m||y[ii][jj]=='X') continue;
				s++;
			}
			if(s>=1)
				cout<<"YES"<<endl;
			else
				cout<<"NO"<<endl;
		}
		else{
			int s=0;
			for(int i=0;i<4;++i){
				int ii=c+dx[i],jj=d+dy[i];
				if(ii<0||ii>=n||jj<0||jj>=m||y[ii][jj]=='X') continue;
				s++;
			}
			if(s>=2)
				cout<<"YES"<<endl;
			else
				cout<<"NO"<<endl;
		}
		return 0;
	}
	queue<node> q;
	q.push({a,b});
	int u=0,u2=0;
	while(!q.empty()){
		node fr=q.front();
		q.pop();
		if(fr.a==c&&fr.b==d){
			u=1;
			break;
		}
		for(int i=0;i<4;++i){
			int ii=fr.a+dx[i],jj=fr.b+dy[i];
			if(ii<0||ii>=n||jj<0||jj>=m) continue;
			if(x[ii][jj]=='X'&&!(ii==c&&jj==d)) continue;
			x[ii][jj]='X';
			q.push({ii,jj});
		}
	}
	if(u==1){
		if(y[c][d]=='X')
			u2=1;
		else{
			int s=0;
			for(int i=0;i<4;++i){
				int ii=c+dx[i],jj=d+dy[i];
				if(ii<0||ii>=n||jj<0||jj>=m||y[ii][jj]=='X') continue;
				s++;
			}
			if(s>=2)
				u2=1;
		}
	}
	if(u==1&&u2==1)
		cout<<"YES"<<endl;
	else
		cout<<"NO"<<endl;
	return 0;
}