#pragma GCC optimize ("Ofast")
#include <bits/stdc++.h>
using namespace std;
#define rep(i,a,n) for (int i=a;i<n;i++)
#define per(i,a,n) for (int i=n-1;i>=a;i--)
#define pb push_back
#define mp make_pair
#define all(x) (x).begin(),(x).end()
#define fi first
#define se second
#define SZ(x) ((int)(x).size())
typedef vector<int> VI;
typedef long long ll;
typedef pair<int,int> PII;
typedef double db;
mt19937 mrand(random_device{}());
const ll mod=1000000007;
int rnd(int x) { return mrand() % x;}
ll powmod(ll a,ll b) {ll res=1;a%=mod; assert(b>=0); for(;b;b>>=1){if(b&1)res=res*a%mod;a=a*a%mod;}return res;}
ll gcd(ll a,ll b) { return b?gcd(b,a%b):a;}
// head
const int N=505;
int n,m,k;
char s[N],pt[10*N];
bitset<N> g[N],dp[N][2];
int main() {
scanf("%d%d%d",&n,&m,&k);
rep(i,1,n+1) {
scanf("%s",s+1);
rep(j,1,m+1) g[i][j]=(s[j]=='.'?1:0);
}
rep(i,1,n+1) dp[i][0]=g[i];
scanf("%s",pt+1);
rep(x,1,k+1) {
rep(i,1,n+1) dp[i][1]=dp[i][0];
if (pt[x]=='N') {
rep(i,1,n+1) dp[i][0]=dp[i+1][1];
}
if (pt[x]=='S') {
rep(i,1,n+1) dp[i][0]=dp[i-1][1];
}
if (pt[x]=='W') {
rep(i,1,n+1) dp[i][0]=(dp[i][1]>>1);
}
if (pt[x]=='E') {
rep(i,1,n+1) dp[i][0]=(dp[i][1]<<1);
}
if (pt[x]=='?') {
rep(i,1,n+1) dp[i][0]=dp[i+1][1];
rep(i,1,n+1) dp[i][0]|=dp[i-1][1];
rep(i,1,n+1) dp[i][0]|=(dp[i][1]>>1);
rep(i,1,n+1) dp[i][0]|=(dp[i][1]<<1);
}
rep(i,1,n+1) dp[i][0]&=g[i];
}
int ans=0;
rep(i,1,n+1) ans+=dp[i][0].count();
printf("%d",ans);
}
