/*
ID: awesome35
LANG: C++14
TASK: vans
*/
#define _CRT_SECURE_NO_WARNINGS
#include<bits/stdc++.h>
#include<unordered_set>
#include<unordered_map>
#include<chrono>
using namespace std;
typedef pair<int, int> pii;
typedef long long ll;
typedef pair<ll, ll> pll;
typedef long double ld;
typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pair<int, int>> vpi;
typedef vector<pair<ll, ll>> vpll;
#define FOR(i,a,b) for (int i = (a); i < (b); ++i)
#define F0R(i,a) FOR(i,0,a)
#define ROF(i,a,b) for (int i = (b)-1; i >= (a); --i)
#define R0F(i,a) ROF(i,0,a)
#define trav(a,x) for (auto& a: x)
#define pb push_back
#define mp make_pair
#define rsz resize
#define sz(x) int(x.size())
#define all(x) x.begin(),x.end()
#define f first
#define s second
#define cont continue
#define endl '\n'
#define ednl '\n'
#define test int testc;cin>>testc;while(testc--)
#define pr(a, b) trav(x,a)cerr << x << b; cerr << endl;
#define message cout << "My name's Ozymandias, king of kings: look on my works, ye mighty and despair!" <<endl;
const int dx[4] = { 1,0,-1,0 }, dy[4] = { 0,1,0,-1 }; // for every grid problem!!
const ll linf = 4000000000000000000LL;
const ll inf = 1000000007;//998244353
const ld pi = 3.1415926535;
void pv(vi a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vll a) { trav(x, a)cout << x << " "; cout << endl; }void pv(vector<vi>a) {
F0R(i, sz(a)) { cout << i << endl; pv(a[i]); cout << endl; }
}void pv(vector<vll>a) { F0R(i, sz(a)) { cout << i << endl; pv(a[i]); }cout << endl; }void pv(vector<string>a) { trav(x, a)cout << x << endl; cout << endl; }
void setIO(string s) {
ios_base::sync_with_stdio(0); cin.tie(0);
if (sz(s))
{
freopen((s + ".in").c_str(), "r", stdin);
if (s != "test1")
freopen((s + ".out").c_str(), "w", stdout);
}
}
int n, m, k;
const int MAX = 502;//11;
bitset<MAX* MAX>a, cur;
int main()
{
setIO("");
cin >> n >> m >> k;
F0R(i, n + 2)
{
F0R(j, m + 2)
{
a[(m + 2) * i + j] = 0;
}
}
FOR(i, 1, n + 1)
{
string x;
cin >> x;
FOR(j, 1, m + 1)
{
a[(m + 2) * i + j] = (x[j - 1] == '.');
}
}
cur |= a;
string move;
cin >> move;
trav(x, move)
{
if (x == 'N')
{
cur = (a & (cur >> (m + 2)));
}
else if (x == 'S')
{
cur = (a & (cur << (m + 2)));
}
else if (x == 'E')
{
cur = (a & (cur << 1));
}
else if (x == 'W')
{
cur = (a & (cur >> 1));
}
else
{
cur = (a & ((cur << 1) | (cur >> 1) | (cur << (m + 2)) | (cur >> (m + 2))));
}
}
cout << cur.count() << endl;
}
