#include <bits/stdc++.h>
#define N 105
using namespace std;
int n, m;
bool vis[N][N];
void bfs(int x, int y) {
    queue<pair<int, int>> q;
    q.push(make_pair(x, y));
    vis[x][y]=true;
    while(!q.empty()) {
        pair<int, int> p=q.front();
        q.pop();
        int x1=p.first, y1=p.second;
        if(x1==m && y1==n) {
        	cout << "Yes";
        	return;
		}
        if(!vis[x1+1][y1]) {
            vis[x1+1][y1]=true;
            q.push(make_pair(x1+1, y1));
        }
        if(!vis[x1][y1+1]) {
            vis[x1][y1+1]=true;
            q.push(make_pair(x1, y1+1));
        }
        if(!vis[x1-1][y1]) {
            vis[x1-1][y1]=true;
            q.push(make_pair(x1-1, y1));
        }
        if(!vis[x1][y1-1]) {
            vis[x1][y1-1]=true;
            q.push(make_pair(x1, y1-1));
        }
    }
    cout << "No";
}
int main() {
    char a;
    cin >> n >> m;
    for(int i = 1;i <= n;i++) {
        for(int j = 1;j <= m;j++) {
            cin >> a;
            if(a=='#') vis[j][i]=true;
        }
    }
    for(int i = 0;i <= n+1;i++) {
        vis[0][i]=vis[m+1][i]=true;
    }
    for(int i = 0;i <= m+1;i++) {
        vis[i][0]=vis[i][n+1]=true;
    }
    bfs(1, 1);
    return 0;
}