/*
* Author: Nonoze
* Created: Saturday 03/01/2026
*/
#include <bits/stdc++.h>
using namespace std;
#ifndef DEBUG
#define dbg(...)
#endif
// #define cout cerr << "OUT: "
#define endl '\n'
#define endlfl '\n' << flush
#define quit(x) return (void)(cout << x << endl)
template<typename T> void read(T& x) { cin >> x; }
template<typename T1, typename T2> void read(pair<T1, T2>& p) { read(p.first), read(p.second); }
template<typename T> void read(vector<T>& v) { for (auto& x : v) read(x); }
template<typename T1, typename T2> void read(T1& x, T2& y) { read(x), read(y); }
template<typename T1, typename T2, typename T3> void read(T1& x, T2& y, T3& z) { read(x), read(y), read(z); }
template<typename T1, typename T2, typename T3, typename T4> void read(T1& x, T2& y, T3& z, T4& zz) { read(x), read(y), read(z), read(zz); }
template<typename T> void print(vector<T>& v) { for (auto& x : v) cout << x << ' '; cout << endl; }
#define sz(x) (int)(x.size())
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define make_unique(v) sort(all(v)), v.erase(unique(all(v)), (v).end())
#define pb push_back
#define mp(a, b) make_pair(a, b)
#define fi first
#define se second
#define cmin(a, b) a = min(a, b)
#define cmax(a, b) a = max(a, b)
#define YES cout << "YES" << endl
#define NO cout << "NO" << endl
#define QYES quit("YES")
#define QNO quit("NO")
#define int long long
#define double long double
const int inf = numeric_limits<int>::max() / 4;
mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());
const int MOD = 1e9+7, LOG=20;
void solve();
signed main() {
ios::sync_with_stdio(0);
cin.tie(0);
int tt=1;
// cin >> tt;
while(tt--) solve();
return 0;
}
int n, k, m, q;
vector<int> a;
void solve() {
read(n, m, k);
vector<bitset<500>> can(n);
for (int i=0; i<n; i++) {
string s; read(s);
for (int j=0; j<m; j++) {
if (s[j]=='.') can[i][j] = 1;
}
}
vector<bitset<500>> is=can, temp(n);
string s; read(s);
for (int t=0; t<k; t++) {
if (s[t]=='N') {
rotate(is.begin(), is.begin()+1, is.end());
is.back().reset();
for (int i=0; i<n; i++) is[i] &= can[i];
} else if (s[t]=='S') {
rotate(is.rbegin(), is.rbegin()+1, is.rend());
is.front().reset();
for (int i=0; i<n; i++) is[i] &= can[i];
} else if (s[t]=='E') {
for (int j=0; j<n; j++) {
is[j] <<= 1;
is[j][0] = 0;
is[j] &= can[j];
}
} else if (s[t]=='W') {
for (int j=0; j<n; j++) {
is[j] >>= 1;
is[j][m-1] = 0;
is[j] &= can[j];
}
} else {
assert(s[t]=='?');
for (int j=0; j<n; j++) {
temp[j] = (is[j] << 1) | (is[j] >> 1);
if (j>0) temp[j] |= is[j-1];
if (j<n-1) temp[j] |= is[j+1];
temp[j] &= can[j];
}
swap(is, temp);
}
}
int ans=0; for (int i=0; i<n; i++) ans += is[i].count();
cout << ans << endl;
}
