#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
inline void smin(T &a, U b) {
  if (a > b) a = b;
}
template <typename T, typename U>
inline void smax(T &a, U b) {
  if (a < b) a = b;
}
template <class T>
inline void gn(T &first) {
  char c, sg = 0;
  while (c = getchar(), (c > '9' || c < '0') && c != '-')
    ;
  for ((c == '-' ? sg = 1, c = getchar() : 0), first = 0; c >= '0' && c <= '9';
       c = getchar())
    first = (first << 1) + (first << 3) + c - '0';
  if (sg) first = -first;
}
template <class T, class T1>
inline void gn(T &first, T1 &second) {
  gn(first);
  gn(second);
}
template <class T, class T1, class T2>
inline void gn(T &first, T1 &second, T2 &z) {
  gn(first);
  gn(second);
  gn(z);
}
template <class T>
inline void print(T first) {
  if (first < 0) {
    putchar('-');
    return print(-first);
  }
  if (first < 10) {
    putchar('0' + first);
    return;
  }
  print(first / 10);
  putchar(first % 10 + '0');
}
template <class T>
inline void printsp(T first) {
  print(first);
  putchar(' ');
}
template <class T>
inline void println(T first) {
  print(first);
  putchar('\n');
}
int power(int a, int b, int m, int ans = 1) {
  for (; b; b >>= 1, a = 1LL * a * a % m)
    if (b & 1) ans = 1LL * ans * a % m;
  return ans;
}
char com[222];
char grid[222][222];
int dx[] = {1, 0, -1, 0};
int dy[] = {0, 1, 0, -1};
int id[4], len;
int n, m, sx, sy, tx, ty;
bool can() {
  int ux = sx, uy = sy;
  for (int i = 0; i < len; i++) {
    int d = com[i] - '0';
    int vx = ux + dx[id[d]];
    int vy = uy + dy[id[d]];
    if (vx < 0 || vy < 0 || vx >= n || vy >= m) return 0;
    if (grid[vx][vy] == '#') return 0;
    if (vx == tx && vy == ty) return 1;
    ux = vx, uy = vy;
  }
  return 0;
}
int main() {
  cin >> n >> m;
  for (int i = 0; i < n; i++) {
    scanf("%s", grid[i]);
    for (int j = 0; j < m; j++) {
      if (grid[i][j] == 'S') sx = i, sy = j;
      if (grid[i][j] == 'E') tx = i, ty = j;
    }
  }
  int ans = 0;
  scanf("%s", com);
  len = strlen(com);
  for (int i = 0; i < 4; i++) id[i] = i;
  while (true) {
    if (can()) ans++;
    if (!next_permutation(id, id + 4)) break;
  }
  println(ans);
  return 0;
}
