#include<iostream>
#include<cstring>
#include<queue>
#define maxn 510
using namespace std;
int n,m,fx,fy,ex,ey;
char a[maxn][maxn];
int vis[maxn][maxn];
int p[4][2]={{0,-1},{-1,0},{1,0},{0,1}};
struct crood{
    int x,y;
};
int main(){
    cin>>n>>m;
    memset(a,0,sizeof(a));
    memset(vis,0,sizeof(vis));
    for(int i=1;i<=n;i++){
        for(int j=1;j<=m;j++){
            cin>>a[i][j];
            if(a[i][j]=='g')fx=i,fy=j;
            if(a[i][j]=='s')ex=i,ey=j;
        }
    }
    vis[fx][fy]=1;
    crood u={fx,fy};
    queue<crood>q;
    q.push(u);
    while(!q.empty()){
        crood u=q.front();
        int sx=u.x,sy=u.y;
        q.pop();
        for(int i=0;i<4;i++){
            int dx=sx+p[i][0],dy=sy+p[i][1];
            if(dx<1||dx>n||dy<1||dy>m||a[dx][dy]=='#'||vis[dx][dy]==1)continue;
            if(a[dx][dy]=='s')vis[dx][dy]=1;
            crood f={dx,dy};
            vis[dx][dy]=1;
            q.push(f);
        }
    }
    if(vis[ex][ey]==1)cout<<"YES"<<endl;
    else cout<<"NO"<<endl;
    return 0;
}