#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef vector<int> vi;
typedef vector<vi> vii;
typedef pair<int,int> pi;
typedef vector<pi> pii;
typedef tuple<int,int,int> ti;
typedef vector<ll> li;
typedef vector<li> lii;
#define REP(i,a,b) for(int i=a;i<b;i++)
#define F first
#define S second
#define PB push_back
#define LSOne(s) ((s)&(-s))
#define all(x) x.begin(),x.end()
ll INF=1000000000000000010;
int inf=1e9+10;
ll M=1e9+7;
int b[500];
int a[2][500];
int main() {
ios::sync_with_stdio(0);
cin.tie(0);
int n,m,k;cin>>n>>m>>k;
memset(a,0,sizeof(a));
memset(b,0,sizeof(b));
REP(i,0,n)REP(j,0,m){
char c;cin>>c;
if(c=='.'){
a[0][i]|=(1<<j);
b[i]|=(1<<j);
}
}
string s;cin>>s;
REP(i,0,k){
if(s[i]=='?')REP(x,0,n){
if(x!=0)a[1][x]|=a[0][x-1];
if(x!=n-1)a[1][x]|=a[0][x+1];
a[1][x]|=(a[0][x]>>1);
a[1][x]|=(a[0][x]<<1);
}
if(s[i]!='?'){
if(s[i]=='N')REP(x,0,n-1)a[1][x]|=a[0][x+1];
else if(s[i]=='S')REP(x,1,n)a[1][x]|=a[0][x-1];
else if(s[i]=='W')REP(x,0,n)a[1][x]|=(a[0][x]>>1);
else if(s[i]=='E')REP(x,0,n)a[1][x]|=(a[0][x]<<1);
}
REP(x,0,n)a[0][x]=a[1][x]&b[x];
memset(a[1],0,sizeof(a[1]));
}
int ans=0;
REP(i,0,n)ans+=__builtin_popcount(a[0][i]);
cout<<ans;
}
