Fox And Two Dots（dfs）

Fox Ciel is playing a mobile puzzle game called "Two Dots". The basic levels are played on a board of size n × m cells, like this:

Each cell contains a dot that has some color. We will use different uppercase Latin characters to express different colors.

The key of this game is to find a cycle that contain dots of same color. Consider 4 blue dots on the picture forming a circle as an example. Formally, we call a sequence of dots d1, d2, ..., dk a cycle if and only if it meets the following condition:

1. These k dots are different: if i ≠ j then di is different from dj.
2. k is at least 4.
3. All dots belong to the same color.
4. For all 1 ≤ i ≤ k - 1: di and di + 1 are adjacent. Also, dk and d1 should also be adjacent. Cells x and y are called adjacent if they share an edge.

Determine if there exists a cycle on the field.

Input

The first line contains two integers n and m (2 ≤ n, m ≤ 50): the number of rows and columns of the board.

Then n lines follow, each line contains a string consisting of m characters, expressing colors of dots in each line. Each character is an uppercase Latin letter.

Output

Output "Yes" if there exists a cycle, and "No" otherwise.

Examples

Input

3 4
AAAA
ABCA
AAAA

Output

Yes

Input

3 4
AAAA
ABCA
AADA

Output

No

Input

4 4
YYYR
BYBY
BBBY
BBBY

Output

Yes

Input

7 6
AAAAAB
ABBBAB
ABAAAB
ABABBB
ABAAAB
ABBBAB
AAAAAB

Output

Yes

Input

2 13
ABCDEFGHIJKLM
NOPQRSTUVWXYZ

Output

No

#include<stdio.h>
#include <math.h>
#include <string.h>
#define maxn 60
char a[maxn][maxn];
bool vis[maxn][maxn];
int flag=0;
int n,m,sx,sy;
int d[4][2]={1,0,-1,0,0,1,0,-1};
bool check(int x,int y)
{
	if(x>=0&&x<n&&y>=0&&y<m&&!vis[x][y])
	{
		return true;
	}
	return false;
}
void dfs(int x,int y,int step) 
{
	vis[x][y]=1;
	if(step>=3&&(abs(x-sx)==1&&abs(y-sy)==0 || abs(x-sx)==0&&abs(y-sy)==1))
	{
		flag=1;
		return;
	}
	for(int i=0;i<4;i++)
	{
		int x1=x+d[i][0];
		int y1=y+d[i][1];
		if(check(x1,y1)&&a[x1][y1]==a[sx][sy])
		{
			dfs(x1,y1,step+1);
			if(flag) return;
		}
		
	}
}
int main()
{
	while(scanf("%d%d",&n,&m)!=EOF)
	{
		flag=0;
	//	memset(vis,0,sizeof(vis));
		memset(a,0,sizeof(a));
		for(int i=0;i<n;i++)
		{
			scanf("%s",a[i]);
		}
		for(int i=0;i<n;i++)
		{
			for(int j=0;j<m;j++)
			{
			memset(vis,0,sizeof(vis));
				sx=i,sy=j;
				dfs(i,j,0);
				if(flag) break;
			}
			if(flag) break;
		}
		if(flag) printf("Yes\n");
		else printf("No\n");
	}
	return 0;
}

Note

In first sample test all 'A' form a cycle.

In second sample there is no such cycle.

The third sample is displayed on the picture above ('Y' = Yellow, 'B' = Blue, 'R' = Red).