#include<bits/stdc++.h>
using namespace std;
int a[101][101],n,m;
char s;
bool dfs(int x,int y)
{
	if(x==n&&y==m)
	{
		return 1;
	}
	if(x<1)
	{
		return 0;
	}
	if(y<1)
	{
		return 0;
	}
	return dfs(x+1,y)||dfs(x-1,y)||dfs(x,y+1)||dfs(x-1,y-1);
}
int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		for(int j=1;j<=m;j++)
		{
			cin>>s;
			if(s=='#')
				a[i][j]=1;
			else
				a[i][j]=0;
		}
	}
	if(dfs(n,m)==1)
		cout<<"Yes";
	else
		cout<<"No";
	return 0;
}