#ifndef local
#pragma GCC optimize("Ofast")
#pragma GCC optimize("unroll-loops")
#pragma GCC optimize("O3")
#endif
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
using ll = long long;
#define int ll
using pii = pair<int, int>;
using pll = pair<ll,ll>;
using str = string;
using ld = long double;
using hash_map =gp_hash_table<int, int>;
using hash_set= gp_hash_table <int, null_type>;
auto sd = std::chrono::high_resolution_clock::now().time_since_epoch().count();
mt19937 rnd(sd);
typedef tree<ll, null_type, less<>, rb_tree_tag,
tree_order_statistics_node_update> ord_set;
const ll maxn = 3e5+8;
void solve1() {
vector<vector<bitset<500>>> dp(5001, vector<bitset<500>>(500));
ll r, c, m;
cin >> r >> c >> m;
vector<bitset<500>> e(500);
for (int i = 0; i < r; i++){
str u;
cin >> u;
for (int j =0; j < c; j++){
if (u[j]=='.'){
dp[0][i].set(j, true);
e[i].set(j, true);
}
}
}
str queries;
cin >> queries;
for (int j = 1; j <= m; j++){
for (int i = 0; i < r; i++){
if (queries[j-1]=='N'){
if (i+1<r){
dp[j][i] = (dp[j][i]|dp[j-1][i+1]);
}
}
else if (queries[j-1]=='S'){
if (i-1>=0){
dp[j][i] = (dp[j][i]|dp[j-1][i-1]);
}
}
else if (queries[j-1]=='W'){
dp[j][i] = (dp[j][i] | (dp[j-1][i]>>1));
}
else if (queries[j-1]=='E'){
dp[j][i] = (dp[j][i] | (dp[j-1][i]<<1));
}
else {
if (i+1<r){
dp[j][i] = (dp[j][i]|dp[j-1][i+1]);
}
if (i-1>=0){
dp[j][i] = (dp[j][i]|dp[j-1][i-1]);
}
dp[j][i] = (dp[j][i] | (dp[j-1][i]>>1));
dp[j][i] = (dp[j][i] | (dp[j-1][i]<<1));
}
dp[j][i] &= e[i];
}
}
ll ans = 0;
for (int i = 0; i < r; i++){
ans += (dp[m][i].count());
}
cout<<ans;
}
signed main() {
ios_base::sync_with_stdio(false);
cin.tie(nullptr);
#ifdef local
freopen("in.txt", "r", stdin);
freopen("out.txt", "w", stdout);
#endif
int t1 = 1;
while (t1) solve1(), t1--;
#ifdef local
printf_s("\n%.5f s", (double) clock() / CLOCKS_PER_SEC);
#endif
}
