#pragma GCC optimize("O3", "unroll-loops", "Ofast") // "Ofast"
#pragma GCC target("avx2", "bmi", "bmi2", "lzcnt", "popcnt")
#include <bits/stdc++.h>
//#define int long long
#define vt vector
#define pb push_back
#define all(x) (x).begin(), (x).end()
#define sz(x) (int)(x).size()
#define f first
#define s second
#define dbg(x) cerr << #x << " = " << x << '\n'
#define bit(x, i) ((x) >> (i) & 1)
using namespace std;
using ll = long long;
using ld = long double;
using pii = pair<int, int>;
const int N = 500 + 5, mod = 1e9 + 7;
const ll inf = 1e18 + 7;
const ld eps = 1e-6;
ll add (ll a, ll b) {
a += b;
if (a < 0) a += mod;
if (a >= mod) a -= mod;
return a;
}
ll mul (ll a, ll b) {
a *= b;
if (a >= mod) a %= mod;
return a;
}
int n, m, M;
string s;
bitset<N> dp[N], dp2[N], b[N];
void solve () {
cin >> n >> m >> M;
char a[n + 1][m + 1];
for (int i = 1; i <= n; i++) {
for (int j = 1; j <= m; j++) cin >> a[i][j], dp[i][j] = b[i][j] = (a[i][j] == '.');
}
cin >> s;
s = ' ' + s;
for (int k = 1; k <= M; k++) {
for (int i = 1; i <= n; i++) {
if (s[k] == 'N') dp2[i] = dp[i + 1];
if (s[k] == 'S') dp2[i] = dp[i - 1];
if (s[k] == 'E') dp2[i] = dp[i] << 1;
if (s[k] == 'W') dp2[i] = dp[i] >> 1;
if (s[k] == '?') dp2[i] = (dp[i + 1] | dp[i - 1] | (dp[i] << 1) | (dp[i] >> 1));
}
for (int i = 1; i <= n; i++) dp[i] = (dp2[i] & b[i]);
}
int ans = 0;
for (int i = 1; i <= n; i++) ans += dp[i].count();
cout << ans;
cout << '\n';
}
bool testcases = 0;
signed main() {
#ifdef AMIR
freopen(".in", "r", stdin);
freopen(".out", "w", stdout);
#endif
cin.tie(0) -> sync_with_stdio(0);
int test = 1;
if (testcases) cin >> test;
for (int cs = 1; cs <= test; cs++) {
solve();
}
}
