Ice Cave

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’.

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

题目大意：

从起点走到终点，要我们从终点掉下去，如果我们走过’ . ‘,它就会变成’ X ‘,走’ X ‘,就会掉下去，起点为’ X ’

代码

#include "stdio.h"
#include "queue"
#include "algorithm"
#include "string.h"
using namespace std;
int n,m,n1,m1;
int n2,m2;
int to[4][2]= {0,1,1,0,0,-1,-1,0};
char a[505][505];
struct ppp
{
	int x,y;
} h,tt;
int qqq()
{
	int i;
	queue<ppp>q;
	h.x=n2;
	h.y=m2;
	q.push(h);
	while(!q.empty())
	{
		h=q.front();
		q.pop();
		for(i=0; i<4; i++)
		{
			tt.x=h.x+to[i][0];
			tt.y=h.y+to[i][1];
			if(tt.x==n1&&tt.y==m1&&a[tt.x][tt.y]=='X')
				return 1;
			if(tt.x<0||tt.x>=n||tt.y<0||tt.y>=m||a[tt.x][tt.y]=='X')
				continue;
//			if(tt.x==n1&&tt.y==m1)
//			{
//				if(tt.x+1<n&&a[tt.x+1][tt.y]=='.')
//					return 1;
//				if(tt.x-1>=0&&a[tt.x-1][tt.y]=='.')
//					return 1;
//				if(tt.y-1>=0&&a[tt.x][tt.y-1]=='.')
//					return 1;
//				if(tt.y+1<m&&a[tt.x][tt.y+1]=='.')
//					return 1;
//				if(1)
//					return 0;
//			}
//不能加上面这步，不然错误，这个写法和广搜差不多，多种路线同时进行，看下面解析 
			a[tt.x][tt.y]='X';
			q.push(tt);
		}
	}
	return 0;
}
int main()
{
	int i,j,k,l;
	scanf("%d%d",&n,&m);
	memset(a,'\0',sizeof(a));
	for(i=0; i<n; i++)
		scanf("%s",a[i]);
	scanf("%d%d%d%d",&n2,&m2,&n1,&m1);
	n2--;
	n1--;
	m1--;
	m2--;
	k=qqq();
	if(k==1)
		printf("YES\n");
	else
		printf("NO\n");
}

解析

有一种情况： 
3 3
...
.X.
.X.
3 2
1 2
两条路同时进行 
...		...		...		X.X		X破X 
.X.---> .X.---> XXX---> XXX---> XXX   
.X.		XXX		XXX		XXX		XXX
两条路线同时进入终点，终点冰碎
但我们加的那部分的代码就不行，两条同时进终点， 
他会优先选这一条路进入终点，然后寻找终点旁边的'.' 但时我们的另一条把终点旁边的'.'-->'X'