#include <iostream>
#include <iomanip>
#include <vector>
#include <string>
#include <queue>
#include <map>
#include <set>
#include <string>
#include <algorithm>
#include <cmath>
#include <unordered_map>
#include <unordered_set>
using namespace std;

#define ll long long
#define nl endl
#define cy cout << "YES\n"
#define cn cout << "NO\n"
#define sz s.size()
#define allv v.begin(), v.end()
void sherry()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
ll n, m;
int x1, n1;
vector<vector<char>> v;
vector<vector<bool>> vis;
bool rec(ll h, ll k)
{
    return h >= n && k >= m && h < 0 && k < 0;
}
bool valid(int h, int k)
{
    if (!rec(h, k) || v[h][k] == '*' || vis[h][k] == 1)
        return false;
    vis[h][k] = 1;
    if (v[h][k] == 'E')
        return true;
    if (valid(h, k + 1))
        return true;
    if (valid(h + 1, k))
        return true;
    if (valid(h, k - 1))
        return true;
    if (valid(h - 1, k))
        return true;
    vis[h][k] = 0;
    return false;
}
void solve()
{
    cin >> n >> m;
    v.resize(n, vector<char>(m));
    vis.resize(n, vector<bool>(m));
    for (int i = 0; i < n; i++)
    {
        for (int j = 0; j < m; j++)
        {
            cin >> v[i][j];
            if (v[i][j] == 'S')
            {
                x1 = i;
                n1 = j;
            }
        }
    }
    if (valid(x1, n1))
        cy;
    else
        cn;
}
int main()
{
    sherry();
    ll t = 1;
    // cin >> t;
    while (t--)
    {
        solve();
    }
    return 0;
}