// #pragma GCC target ("avx,avx2,fma")
// #pragma GCC optimize ("Ofast,inline") // O1 - O2 - O3 - Os - Ofast
// #pragma GCC optimize ("unroll-loops")
#include <bits/stdc++.h>
using namespace std;
#define rep(i, a, b) for (int i = (a); i < (b); ++i)
#define per(i, a, b) for (int i = (b - 1); i >= (a); --i)
#define trav(a, x) for (auto &a : x)
#define all(x) x.begin(), x.end()
#define sz(x) x.size()
#define pb push_back
#define debug(x) cout<<#x<<" = "<<x<<endl
#define umap unordered_map
#define uset unordered_set
typedef pair<int, int> ii;
typedef pair<int, ii> iii;
typedef vector<int> vi;
typedef vector<ii> vii;
typedef vector<vi> vvi;
typedef long long ll;
typedef pair<ll,ll> pll;
typedef vector<ll> vll;
typedef vector<pll> vpll;
const int INF = 1'000'000'007;
bitset<501>grid[501],dp[2][501];
int rows,cols,m;
string moves;
int main() {
cin.tie(0)->sync_with_stdio(0);
cin.exceptions(cin.failbit);
cin>>rows>>cols>>m;
rep(i,0,rows) {
string row;
cin>>row;
rep(j,0,cols)grid[i][j]=row[j]=='.';
dp[0][i]=grid[i];
}
int cur=0,nxt=1;
cin>>moves;
trav(dir,moves) {
rep(i,0,rows)dp[nxt][i].reset();
if(dir=='N'||dir=='?') rep(i,1,rows)dp[nxt][i-1]=dp[cur][i];
if(dir=='S'||dir=='?') rep(i,0,rows-1)dp[nxt][i+1]|=dp[cur][i];
if(dir=='W'||dir=='?') rep(i,0,rows)dp[nxt][i]|=dp[cur][i]>>1;
if(dir=='E'||dir=='?') rep(i,0,rows)dp[nxt][i]|=dp[cur][i]<<1;
rep(i,0,rows) dp[nxt][i]&=grid[i];
swap(cur,nxt);
}
int ans=0;
rep(i,0,rows) {
ans+=dp[cur][i].count();
//string row=string(cols,'.');
//rep(j,0,cols)if(dp[cur][i][j])row[j]='#';
//cout<<row<<endl;
}
cout<<ans<<endl;
return 0;
}
