#include<bits/stdc++.h>
using namespace std;
int n,m,dx[4]={1,0,-1,0},dy[4]={0,1,0,-1};
char a[105][105];
bool vis[105][105];
struct node{
    int x,y;
};
queue<node> q;
void bfs(){
    q.push(node{1,1});
    vis[1][1]=1;
    while(!q.empty())
    {
        int x=q.front().x,y=q.front().y;
        q.pop();
        for(int i=0;i<4;i++)
        {
            int x_new=x+dx[i],y_new=y+dy[i];
            if(x_new<1||x_new>n||y_new<1||y_new>m)continue;
            if(vis[x_new][y_new]==true)continue;
            if(x_new==n&&y_new==m){
                cout<<"Yes"<<endl;
                return ;
            }
            q.push(node{x_new, y_new});
			vis[x_new][y_new] = true;
        }
    }
    cout<<"No"<<endl;
}
int main()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++)
        for(int j=1;j<=m;j++)
            cin>>a[i][j];
    bfs();
    return 0;
}