#include<bits/stdc++.h>
/*
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;
*/
using namespace std;
#pragma GCC optimize ("unroll-loops,Ofast,O3")
#pragma GCC target("avx,avx2,fma")
#define F first
#define int short
#define S second
#define sz(x) (int)x.size()
#define pb push_back
#define eb emplace_back
#define all(x) (x).begin(),(x).end()
#define rall(x) (x).rbegin(),(x).rend()
#define NFS ios_base::sync_with_stdio(0) , cin.tie(0) , cout.tie(0) ;
#define file(s) if (fopen(s".in", "r")) freopen(s".in", "r", stdin), freopen(s".out", "w", stdout)
//#define ordered_set tree<int, null_type,less<int>, rb_tree_tag,tree_order_statistics_node_update>
typedef long long ll;
const long long inf = 1e18+777;
const int N = 5555;
int n, m, K;
bitset<555> used[N][555];
signed main(){
NFS;
cin >> n >> m >> K;
for(int i = 1; i <= n; ++i){
for(int j = 1; j <= m; ++j){
char x; cin >> x;
used[0][i][j] = (x == '.');
}
}
string s; cin >> s; s = ' ' + s;
for(int k = 1; k <= K; ++k){
for(int i = 1; i <= n; ++i){
used[k][i] = used[0][i];
if(s[k] == 'N'){
used[k][i] &= used[k-1][i+1];
}
if(s[k] == 'S'){
used[k][i] &= used[k-1][i-1];
}
if(s[k] == 'E'){
used[k][i] &= (used[k-1][i] << 1);
}
if(s[k] == 'W'){
used[k][i] &= (used[k-1][i] >> 1);
}
if(s[k] == '?'){
used[k][i] &= ((used[k-1][i] << 1)|(used[k-1][i] >> 1)|used[k-1][i-1]|used[k-1][i+1]);
}
}
}
int res = 0;
for(int i = 1; i <= n; ++i){
res += used[K][i].count();
}
cout << res;
};
