CodeForces-540C//Codeforces Round #301 (Div. 2)C BFS

C. Ice Cave

time limit per test

2 seconds

memory limit per test

256 megabytes

input

standard input

output

standard output

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.

先BFS到终点，然后加点判断，如果终点是' X '，直接就可以YES，如果是' .' 要看看他四周有几个也以去的点，大于等于两个则YES，否则NO，因为有一个点是走过来的，只要还存在一个点可以走，走一下这个点然后再回去即可

有几个特殊的样例需要考虑
当起点和终点重合时，周围只要有一个可以走的点即可，因为起点一定是‘ X ’ ，只需有一个点走一下在回来即可

#include<stdio.h>
#include<string.h>
#include<math.h>
#include<string>
#include<algorithm>
#include<queue>
#include<vector>
#include<map>
#include<set>
#define MEM(a) memset(a,0,sizeof(a))
typedef long long ll;
using namespace std;
struct node
{
	int x,y;
}re,pe;
char mapp[600][600];
int book[600][600];
int n,m,xx1,xx2,yy1,yy2;//起点坐标和终点坐标
int ne[4][2]={0,1,0,-1,1,0,-1,0};//方向数组
int check(node t)//BFS的判断函数
{
	if(t.x==xx2&&t.y==yy2)
	return 0;
	if(t.x<0||t.x>=n||t.y<0||t.y>=m||mapp[t.x][t.y]=='X'||book[t.x][t.y])
	{
		return 1;
	}
	return 0;
}
int check1(node t)//判断终点四周有几个可走的点 
{
	if(t.x==xx1&&t.y==yy1)
	return 0;
	if(t.x<0||t.x>=n||t.y<0||t.y>=m||mapp[t.x][t.y]=='X')
	{
		return 1;
	}
	return 0;
}
int bfs(node begin)
{
	int i;
	queue<node>q;
	q.push(begin);
	while(!q.empty())
	{
		re=q.front();
		q.pop();
		if(re.x==xx2&&re.y==yy2)
		{
			if(mapp[re.x][re.y]=='X') 
			{	
				printf("YES\n");
				return 0;
			}
			int mx=0;
			for(i=0;i<4;i++)
			{
				pe=re;
				pe.x+=ne[i][0];
				pe.y+=ne[i][1];
				if(check1(pe))
				continue;
				mx++;
			}
			if(mx>=2)
			{
				printf("YES\n");
				return 0;	
			}
		}
		for(i=0;i<4;i++)
		{
			pe=re;
			pe.x+=ne[i][0];
			pe.y+=ne[i][1];
			if(check(pe))
			continue;
			book[pe.x][pe.y]=1;
			q.push(pe);
		}
	}
	printf("NO\n");
	return 0;
}
int main()
{
	scanf("%d %d",&n,&m);
	getchar();
	for(int i=0;i<n;i++)
	{
		scanf("%s",mapp[i]);	
	}

	scanf("%d %d",&xx1,&yy1);
	scanf("%d %d",&xx2,&yy2);
	xx1--;
	yy1--;
	xx2--;
	yy2--;
	//地图保存下标从0开始。。。。。懒得改上面了。。 
	if(xx1==xx2&&yy1==yy2)
	{
		re.x=xx1;
		re.y=yy1;
		int mx=0;
		for(int i=0;i<4;i++)
			{
				pe=re;
				pe.x+=ne[i][0];
				pe.y+=ne[i][1];
				if(check1(pe))
				continue;
				mx++;
			}
			if(mx>=1)
			printf("YES\n");
			else
			printf("NO\n");
			return 0;
	}
	node begin;
	begin.x=xx1;
	begin.y=yy1;
	bfs(begin);
	return 0;
 }