#include <iostream>

#include <cstdio>

#include <cstring>

#include <cmath>

#include <algorithm>

using namespace std;

int n, m,xchushi,ychushi, x, y;

char s[][];

string c;

int a[];

int shu[] = {, , , };//最初表示0上1下2左3右

int cnt;//记录情况的可能

int f;

int main() {

    ios::sync_with_stdio();

    cin.tie();

    cout.tie();

    cin >> n >> m;

    for (int i = ; i < n; i++) {

        for (int j = ; j < m; j++) {

            cin >> s[i][j];

            //cout << s[i][j];

            if (s[i][j] == 'S') {

                xchushi = i;

                ychushi = j;

            }

        }

        //cout << endl;

    }

    cin >> c;

    //cout << c << endl;

    for (int i = ; i < c.size(); i++)

        a[i] = c[i] - '';

    do {

        x = xchushi;

        y = ychushi;

        for (int i = ; i < c.size(); i++) {

            if (a[i] == shu[])

                x--;

            else if (a[i] == shu[])

                x++;

            else if (a[i] == shu[])

                y--;

            else y++;

            if(x <  || y <  || x >= n || y >= m)//x最初代表上下，所以要和n比较;y代表左右，所以要和m比较,z

                break;

            if (s[x][y] == 'E') {

                f++;

                break;

            }

            if (s[x][y] == '#')

                break;

        }

        cnt += f;

        f = ;

    } while (next_permutation(shu, shu + ));

    cout << cnt << endl;

    return ;

}