//B3625 源代码如下

#include<iostream>
using namespace std;
int n,m,ans=0;
char s[105][105];
bool vis[105][105];
void dfs(int x,int y){
	if(x<0||x>=n||y<0||y>=m||vis[x][y]||ans||s[x][y]=='#')return;
	vis[x][y]=1;
	if(x==n-1||y==m-1)ans=1;
	dfs(x-1,y);
	dfs(x,y-1);
	dfs(x+1,y);
	dfs(x,y+1);
	return;
}
int main(){
	cin>>n>>m;
	for(int i=0;i<n;i++){
		for(int j=0;j<m;j++){
			cin>>s[i][j];
		}
	}
	dfs(0,0);
	if(ans==1)cout<<"Yes";
	else cout<<"No";
	return 0;
}