#include <bits/stdc++.h>
#define FOR(i,a,b) for(int i=a;i<=(int)b;i++)
#define FORD(i,a,b) for(int i=a;i>=(int)b;i--)
#define fi first
#define se second
#define pb push_back
#define ALL(A) A.begin(), A.end()
#define BIT(mask,i) ((mask>>(i))&1)
#define ll long long
using namespace std;
template <class A, class B> bool maximize(A &a, const B b) {if(a<b){a = b;return 1;} return 0;}
template <class A, class B> bool minimize(A &a, const B b) {if(a>b){a = b;return 1;} return 0;}
const int maxn = 5005;
int n, m, lenS;
string s;
char a[maxn][maxn];
void init()
{
cin >> n >> m >> lenS;
FOR(i, 1, n) FOR(j, 1, m)
{
cin >> a[i][j];
}
cin >> s; s = '*' + s;
}
bool dp[505][505][505];
const int dx[] = {- 1, 0, 1, 0};
const int dy[] = {0, 1, 0, - 1};
int get(char x)
{
if(x == 'N') return 0;
if(x == 'E') return 1;
if(x == 'S') return 2;
return 3;
}
void process()
{
FOR(i, 1, n) FOR(j, 1, m)
{
if(a[i][j] == '.') dp[i][j][0] = 1;
}
FOR(turn, 1, lenS) FOR(i, 1, n) FOR(j, 1, m)
{
if(a[i][j] == '#') continue;
if(s[turn] == 'N' || s[turn] == '?')
{
dp[i][j][turn]|= dp[i + 1][j][turn - 1];
}
if(s[turn] == 'E' || s[turn] == '?')
{
dp[i][j][turn] |= dp[i][j - 1][turn - 1];
}
if(s[turn] == 'S' || s[turn] == '?')
{
dp[i][j][turn] |= dp[i - 1][j][turn - 1];
}
if(s[turn] == 'W' || s[turn] == '?')
{
dp[i][j][turn] |= dp[i][j + 1][turn - 1];
}
}
int ans = 0;
FOR(i, 1, n) FOR(j, 1, m) if(dp[i][j][lenS])
{
/// cout << i << " " << j << "\n";
ans++;
}
cout << ans;
}
signed main()
{
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#define Hori "kieuoanh"
if(fopen(Hori".inp", "r"))
{
freopen(Hori".inp", "r", stdin);
freopen(Hori".out", "w", stdout);
}
init();
process();
return 0;
}
