#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cmath>
#include<cstring>
using namespace std;
int n,m;
char Map[110][110];
bool dp[110][110];
int Go[2][4]={1,-1,0,0,0,0,1,-1};
bool func(int x,int y){
    if(x==n && y==m) return true;
    if(x<=0 || y<=0 || x>n || y>m) return false;
    dp[x][y]=1;
    for(int i=0;i<4;i++){
        int nx=x+Go[0][i],ny=y+Go[1][i];
        if(dp[nx][ny]) continue;
        if(func(nx,ny)) return true; 
    }
    dp[x][y]=0;
}
int main(){
    cin>>n>>m;
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>Map[i][j];
            if(Map[i][j]=='#') dp[i][j]=1;
            else dp[i][j]=0;
        }
    }
    bool flag=func(1,1);
    if(flag) cout<<"Yes";
    else cout<<"No";
    return 0;
}

QAQ