#include<iostream>
using namespace std;
char map[502][502];
int i, j, x, y, dx, dy, n, m, sx, sy, tx, ty, x1, x2;
int dirx[4] = { 0,0,-1,1 };//下  左  上 右
int diry[4] = { 1,-1,0,0 };
int vis[502][502];
bool in(int x, int y)
{
	if (x > 0 && x <= n && y > 0 && y <= m)
		return true;
	return false;
}
void dfs(int sx, int sy)
{
	
	vis[sx][sy] = 1;
	for (i = 0; i <= 3; i++)
	{
		tx = sx + dirx[i];
		ty = sy + diry[i];
		if (in(tx,ty) && map[tx][ty] != '#' && vis[tx][ty] == 0)
			dfs(tx, ty);
	}
	
}
int main()
{
	cin >> n >> m;
	for (i = 1; i <= n; i++)
		for(j=1;j<=m;j++)
		cin >> map[i][j];
	for (i = 1; i <= n; i++)
		for (j = 1; j <= m; j++)
		{
			if (map[i][j] == 's')
			{
				sx = i;
				sy = j;
			}
			if (map[i][j] == 'g')
			{
				x1 = i;
				x2 = j;
			}
		}
	
	dfs(sx, sy);
	if (vis[x1][x2]==1)
		printf("Yes");
	else
		printf("No");
	

	
}