// Om Namah Shivaya
#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace std;
using namespace __gnu_pbds;
template<typename T> using Tree = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
typedef long long int ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
#define fastio ios_base::sync_with_stdio(false); cin.tie(NULL)
#define pb push_back
#define endl '\n'
#define sz(a) a.size()
#define setbits(x) __builtin_popcountll(x)
#define ff first
#define ss second
#define conts continue
#define ceil2(x, y) ((x + y - 1) / (y))
#define all(a) a.begin(), a.end()
#define rall(a) a.rbegin(), a.rend()
#define yes cout << "Yes" << endl
#define no cout << "No" << endl
#define rep(i, n) for(int i = 0; i < n; ++i)
#define rep1(i, n) for(int i = 1; i <= n; ++i)
#define rev(i, s, e) for(int i = s; i >= e; --i)
#define trav(i, a) for(auto &i : a)
template<typename T>
void amin(T &a, T b) {
a = min(a, b);
}
template<typename T>
void amax(T &a, T b) {
a = max(a, b);
}
#ifdef LOCAL
#include "debug.h"
#else
#define debug(x) 42
#endif
/*
*/
const int MOD = 1e9 + 7;
const int N = 1e5 + 5;
const int inf1 = int(1e9) + 5;
const ll inf2 = ll(1e18) + 5;
void solve(int test_case)
{
ll n,m,k; cin >> n >> m >> k;
char a[n+5][m+5];
rep(i,n+5) rep(j,m+5) a[i][j] = '#';
rep1(i,n) rep1(j,m) cin >> a[i][j];
string s; cin >> s;
s = "$" + s;
// rep1(i,n){
// rep1(j,m){
// if(a[i][j] == '#') conts;
// vector<string> possible;
// possible.pb("$");
// rep1(p,k){
// char ch = s[p];
// vector<string> possible2;
// trav(s1,possible){
// if(ch != '?'){
// possible2.pb(s1+ch);
// }
// else{
// possible2.pb(s1+'N');
// possible2.pb(s1+'S');
// possible2.pb(s1+'E');
// possible2.pb(s1+'W');
// }
// }
// possible = possible2;
// }
// bool good = false;
// trav(s1,possible){
// ll r = i, c = j;
// bool flag = true;
// rep1(p,k){
// char ch = s1[p];
// if(ch == 'N') r--;
// else if(ch == 'S') r++;
// else if(ch == 'E') c++;
// else c--;
// if(a[r][c] == '#'){
// flag = false;
// break;
// }
// }
// if(flag){
// good = true;
// break;
// }
// }
// if(good){
// debug(1);
// }
// }
// }
bool dp[n+5][m+5][k+5];
memset(dp,0,sizeof dp);
rep1(i,n){
rep1(j,m){
if(a[i][j] == '.'){
dp[i][j][k+1] = 1;
}
}
}
rev(p,k,1){
char ch = s[p];
rep1(i,n){
rep1(j,m){
if(a[i][j] == '#') conts;
if(ch == '?'){
dp[i][j][p] = (dp[i-1][j][p+1] | dp[i+1][j][p+1] | dp[i][j-1][p+1] | dp[i][j+1][p+1]);
}
else{
if(ch == 'N') dp[i][j][p] = dp[i-1][j][p+1];
if(ch == 'S') dp[i][j][p] = dp[i+1][j][p+1];
if(ch == 'E') dp[i][j][p] = dp[i][j+1][p+1];
if(ch == 'W') dp[i][j][p] = dp[i][j-1][p+1];
}
}
}
}
ll ans = 0;
rep1(i,n){
rep1(j,m){
if(dp[i][j][1]){
pll px = {i,j};
// debug(px);
}
ans += dp[i][j][1];
}
}
cout << ans << endl;
}
int main()
{
fastio;
int t = 1;
// cin >> t;
rep1(i, t) {
solve(i);
}
return 0;
}
