#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,g[N][N];
char s[N],pt[N*10];
unordered_map<int,bool> dp[N][N];
bool valid(int x,int y) {
return x>=1&&x<=n&&y>=1&&y<=m;
}
bool gao(int i,int j,int x) {
if (!valid(i,j)||g[i][j]==0) return false;
if (x==0) { return true; }
if (dp[i][j].count(x)) return dp[i][j][x];
bool ok=false;
if (pt[x]=='N'||pt[x]=='?') ok|=gao(i+1,j,x-1);
if (pt[x]=='S'||pt[x]=='?') ok|=gao(i-1,j,x-1);
if (pt[x]=='W'||pt[x]=='?') ok|=gao(i,j+1,x-1);
if (pt[x]=='E'||pt[x]=='?') ok|=gao(i,j-1,x-1);
dp[i][j][x]=ok;
return ok;
}
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);
}
scanf("%s",pt+1);
int ans=0;
rep(i,1,n+1) rep(j,1,m+1) ans+=(gao(i,j,k)?1:0);
printf("%d",ans);
}
