#include <bits/stdc++.h>
//#pragma comment(linker, "/stack:200000000")
//#pragma GCC optimize("Ofast")
//#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,tune=native")
#define fast ios_base::sync_with_stdio(false);cin.tie(nullptr);cout.tie(nullptr);
#define all(v) v.begin(),v.end()
#define pb push_back
#define sz size()
#define ft first
#define sd second
using namespace std;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef unsigned long long ull;
const int N = 2e5 + 5;
const ll M = 1e8;
const ll inf = 1e9;
const ll mod = 1e9;
const double Pi = acos(-1);
ll binpow(ll x, ll ti) { ll res = 1;while (ti){if(ti & 1)res *= x;x *= x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll binmul(ll x, ll ti) { ll res = 0;while (ti){if(ti & 1)res += x;x += x;ti >>= 1; x %= mod; res %= mod;} return res;}
ll nok(ll a, ll b) { return (a*b)/__gcd(abs(a),abs(b)) * (a*b > 0 ? 1 : -1); }
bool odd(ll n) { return (n % 2 == 1); }
bool even(ll n) { return (n % 2 == 0); }
ll n, m, k;
char c[505][505];
string s;
bitset <505> b[505][5005];
const void solve(/*Armashka*/) {
cin >> n >> m >> k;
for (int i = 1; i <= n; ++ i) {
for (int j = 1; j <= m; ++ j) {
cin >> c[i][j];
if (c[i][j] == '#') b[i][0][j] = 0;
else b[i][0][j] = 1;
}
}
cin >> s;
for (int i = 1; i <= k; ++ i) {
char x = s[i - 1];
for (int j = 1; j <= n; ++ j) {
b[j][i] = b[j][0];
if (x == 'E') {
b[j][i] &= (b[j][i - 1] << 1);
}
if (x == 'W') {
b[j][i] &= (b[j][i - 1] >> 1);
}
if (x == 'N') {
b[j][i] &= b[j + 1][i - 1];
}
if (x == 'S') {
b[j][i] &= b[j - 1][i - 1];
}
if (x == '?') {
b[j][i] &= ((b[j][i - 1] << 1) | (b[j][i - 1] >> 1) | (b[j + 1][i - 1]) | (b[j - 1][i - 1]));
}
}
}
ll ans = 0;
for (int i = 1; i <= n; ++ i) ans += b[i][k].count();
cout << ans << "\n";
}
signed main() {
fast;
//freopen("divide.in", "r", stdin);
//freopen("divide.out", "w", stdout);
int tt = 1;
//cin >> tt;
while (tt --) {
solve();
}
}
/*
5 4 4
1 2
3 1
3 4
5 3
4 5 2 3
2 1 3 1
1 3 5
2 3 4 5
2 1 3 1
*/
