#include <bits/stdc++.h>
#pragma GCC optimize ("O2")
#pragma GCC optimize ("unroll-loops")
//#pragma GCC optimize("no-stack-protector,fast-math")
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<pii, int> piii;
typedef pair<ll, ll> pll;
#define debug(x) cerr<<#x<<'='<<(x)<<endl;
#define debugp(x) cerr<<#x<<"= {"<<(x.first)<<", "<<(x.second)<<"}"<<endl;
#define debug2(x, y) cerr<<"{"<<#x<<", "<<#y<<"} = {"<<(x)<<", "<<(y)<<"}"<<endl;
#define debugv(v) {cerr<<#v<<" : ";for (auto x:v) cerr<<x<<' ';cerr<<endl;}
#define all(x) x.begin(), x.end()
#define pb push_back
#define kill(x) return cout<<x<<'\n', 0;
const ld eps=1e-7;
const int inf=1000000010;
const ll INF=10000000000000010LL;
const int mod = 1000000007;
const int MAXN = 503, LOG=20;
int n, m, k, u, v, x, y, t, a, b, ans;
bitset<MAXN> A[MAXN], dp[MAXN], tmp[MAXN];
char ch;
int main(){
ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0);
//freopen("input.txt", "r", stdin);
//freopen("output.txt", "w", stdout);
cin>>n>>m>>k;
for (int i=1; i<=n; i++) for (int j=1; j<=m; j++){
cin>>ch;
dp[i][j]=A[i][j]=(ch=='.');
}
while (k--){
cin>>ch;
if (ch=='N' || ch=='?'){
for (int i=1; i<n; i++) tmp[i]=dp[i+1];
}
if (ch=='S' || ch=='?'){
for (int i=2; i<=n; i++) tmp[i]|=dp[i-1];
}
if (ch=='E' || ch=='?'){
for (int i=1; i<=n; i++) tmp[i]|=dp[i]<<1;
}
if (ch=='W' || ch=='?'){
for (int i=1; i<=n; i++) tmp[i]|=dp[i]>>1;
}
for (int i=1; i<=n; i++) dp[i]=tmp[i]&A[i], tmp[i].reset();
}
for (int i=1; i<=n; i++) ans+=dp[i].count();
cout<<ans<<'\n';
return 0;
}
