#pragma GCC optimize("Ofast")
#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;
#pragma region dalykai
template <typename F>
void _debug(F f)
{
f();
}
#ifndef _AAAAAAAAA
#define debug(x)
#else
#define debug(x) _debug(x)
#endif
using p32 = pair<int, int>;
using p32u = pair<uint32_t, uint32_t>;
using p64 = pair<int64_t, int64_t>;
using p64u = pair<uint64_t, uint64_t>;
using vi16 = vector<int16_t>;
using vi16u = vector<uint16_t>;
using vi32 = vector<int>;
using vi32u = vector<uint32_t>;
using vi64 = vector<int64_t>;
using vi64u = vector<uint64_t>;
using vp32 = vector<p32>;
using vp32u = vector<p32u>;
using vp64 = vector<p64>;
using vp64u = vector<p64u>;
using vvi32 = vector<vi32>;
using vvi32u = vector<vi32u>;
using vvi64 = vector<vi64>;
using vvi64u = vector<vi64u>;
using vvp32 = vector<vp32>;
using vvp32u = vector<vp32u>;
using vvp64 = vector<vp64>;
using vvp64u = vector<vp64u>;
using f80 = long double;
#pragma endregion
using grid_t = vector<string>;
bool inside(int i, int j, int row, int col)
{
return i >= 0 && i < row && j >= 0 && j < col;
}
int main()
{
#ifndef _AAAAAAAAA
ios_base::sync_with_stdio(false);
cin.tie(0);
#else
freopen("nautilus.in", "r", stdin);
#ifndef __linux__
atexit([]()
{
freopen("con", "r", stdin);
system("pause"); });
#endif
#endif
int row, col, n;
cin >> row >> col >> n;
grid_t grid(row);
for (auto &r : grid)
{
cin >> r;
}
string message;
cin >> message;
map<char, int> command;
command['N'] = 0;
command['S'] = 1;
command['E'] = 2;
command['W'] = 3;
command['?'] = 4;
for (auto &c : message)
{
c = (char)command[c];
}
using set_t = bitset<5000>;
vector<set_t> cur(row), next;
for (auto &r : cur)
{
r.set();
}
const vi16 dr = {-1, 1, 0, 0};
const vi16 dc = {0, 0, 1, -1};
for (int l = 0; auto &c : message)
{
next = vector<set_t>(row);
for (int i = 0; i < row; i++)
{
for (int j = 0; j < col; j++)
{
if (!cur[i][j] || grid[i][j] == '#')
{
continue;
}
for (int k = (c == 4) ? 0 : c; (c == 4) ? (k < 4) : (k < c + 1); k++)
{
int a = i + dr[k];
int b = j + dc[k];
if (inside(a, b, row, col))
{
next[a][b] = grid[a][b] != '#';
}
}
}
}
swap(next, cur);
l++;
}
size_t total = 0;
for (int i = 0; auto &r : cur)
{
debug([&]()
{
string s = r.to_string();
reverse(s.begin(), s.end());
s.erase(s.begin() + col, s.end());
for (int j = 0; j < col; j++)
{
if (grid[i][j] == '#')
{
s[j] = '#';
}
if (s[j] == '0')
{
s[j] = '.';
}
}
cout << s << '\n';
//
});
total += r.count();
i++;
}
cout << total << '\n';
return 0;
}
