//Code By CXY07 - It's My Fiesta.
#include<bits/stdc++.h>
using namespace std;

//#define FILE
#define int long long
#define randint(l, r) (rand() % ((r) - (l) + 1) + (l))
#define abs(x) ((x) < 0 ? (-(x)) : (x))
#define popc(x) __builtin_popcount(x)
#define inv(x) qpow((x), mod - 2)
#define lowbit(x) ((x) & (-(x)))
#define ull unsigned long long
#define pii pair<int, int>
#define LL long long
#define mp make_pair
#define pb push_back
#define scd second
#define vec vector
#define fst first
#define endl '\n'
#define y1 _y1

const int MAXN = 1510;
const int SIZ = (1 << 23) + 10;
const int MAXK = 5e6 + 10;
const int INF = 2e9;
const double eps = 1e-6;
const double PI = acos(-1);
//const int mod = 1e9 + 7;
const int mod = 998244353;
const int GG = 3;
//const int base = 131;

int n, m, k, Ans, blen;
int sL[MAXN], sR[MAXN], sum[MAXN][MAXN];
int F[SIZ], G[SIZ];
int rev[SIZ], ll, lim, ilim, Gi, Gp[SIZ], iGp[SIZ];
char mmp[MAXN][MAXN], mv[MAXK];
bool tmp[MAXN << 1][MAXN << 1];

template<typename T> inline bool read(T &a) {
	a = 0; char c = getchar(); int f = 1;
	while(c < '0' || c > '9') { if(c == '-') f = -1; c = getchar(); }
	while(c >= '0' && c <= '9') { a = a * 10 + (c ^ 48); c = getchar(); }
	return a *= f, true;
}

template<typename A, typename ...B>
inline bool read(A &x, B &...y) { return read(x) && read(y...); }

int qpow(int x, int b) {
	int res = 1;
	for(; b; b >>= 1, (x *= x) %= mod) if(b & 1) (res *= x) %= mod;
	return res;
}

void Init(int x) {
	lim = 1, ll = 0;
	while(lim < x) lim <<= 1, ++ll;
	ilim = inv(lim), Gi = inv(GG);
	for(int i = 0; i < lim; ++i)
		rev[i] = ((rev[i >> 1] >> 1) | ((i & 1) << (ll - 1)));
	for(int mid = 1; mid < lim; mid <<= 1) {
		Gp[mid] = qpow(GG, (mod - 1) / (mid << 1));
		iGp[mid] = qpow(Gi, (mod - 1) / (mid << 1));
	}
}

void format(int x) {
	lim = 1, ll = 0;
	while(lim < x) lim <<= 1, ++ll;
	ilim = inv(lim);
	for(int i = 0; i < lim; ++i)
		rev[i] = ((rev[i >> 1] >> 1) | ((i & 1) << (ll - 1)));
}

void NTT(int *A, int opt) {
	for(int i = 0; i < lim; ++i)
		if(rev[i] < i) swap(A[i], A[rev[i]]);
	for(int mid = 1, w; mid < lim; mid <<= 1) {
		w = (opt == 1) ? Gp[mid] : iGp[mid];
		for(int i = 0, x, y, now; i < lim; i += (mid << 1)) {
			now = 1;
			for(int j = 0; j < mid; ++j, now = now * w % mod) {
				x = A[i + j], y = A[i + j + mid] * now % mod;
				A[i + j] = x + y, A[i + j + mid] = x - y + mod;
			}
		}
		if(mid == 512 || mid == 512 * 512)
			for(int i = 0; i < lim; ++i) A[i] %= mod;
	}
	for(int i = 0; i < lim; ++i) A[i] %= mod;
	if(opt == 1) return;
	for(int i = 0; i < lim; ++i) A[i] = A[i] * ilim % mod;
}

signed main () {
#ifdef FILE
	freopen("19.in", "r", stdin);
	freopen("B.out", "w", stdout);
#endif
	read(n), read(m), read(k);
	for(int i = 1; i <= n; ++i) {
		scanf("%s", mmp[i] + 1);
		for(int j = 1; j <= m; ++j) {
			sum[i][j] = mmp[i][j] - '0';
			F[(i - 1) * m + (j - 1)] = mmp[i][j] - '0';
		}
	}
	scanf("%s", mv + 1);
	int curx = n, cury = m;
	tmp[curx][cury] = true;
	for(int i = 1; i <= k; ++i) {
		if(mv[i] == 'w') curx--;
		if(mv[i] == 'a') cury--;
		if(mv[i] == 's') curx++;
		if(mv[i] == 'd') cury++;
		tmp[curx][cury] = true;
	}
	int H = 0, mn = INF, len = 0;
	for(int i = 0, sum; i < (MAXN << 1); ++i) {
		sum = 0;
		for(int j = 0; j < (MAXN << 1); ++j)
			sum += tmp[i][j];
		if(!sum) continue;
		++H; sL[H] = -1;
		for(int j = 0; j < (MAXN << 1); ++j) {
			if(!tmp[i][j]) continue;
			if(sL[H] == -1) sL[H] = j;
			sR[H] = j;
		}
	}
	for(int i = 1; i <= H; ++i) mn = min(mn, sL[i]);
	for(int i = 1; i <= H; ++i) {
		sL[i] -= mn, sR[i] -= mn;
		len = max(len, sR[i] + 1);
	}
	for(int i = 0, t = 0, cc = 0; i < (MAXN << 1); ++i) {
		t = 0;
		for(int j = 0; j < (MAXN << 1); ++j) t += tmp[i][j];
		if(!t) continue;
		for(int j = 0; j < (MAXN << 1); ++j) {
			if(!tmp[i][j]) continue;
			//cerr << cc << ' ' << j - mn << endl;
			G[(n - cc) * m + (m - (j - mn))] = 1;
			//V[cc].set(j - mn);
		}
		++cc;
	}
	/*for(int i = 0; i <= n * m; ++i)
		cout << F[i] << ' ';
	cout << endl;
	for(int i = 0; i <= n * m; ++i)
		cout << G[i] << ' ';
	cout << endl;*/
	Init(((n + 1) * (m + 1)) << 1);
	NTT(F, 1), NTT(G, 1);
	for(int i = 0; i < lim; ++i) F[i] = F[i] * G[i] % mod;
	NTT(F, -1);
	for(int i = 0; i < n - H + 1; ++i) {
		for(int j = 0; j < m - len + 1; ++j) {
			if(!F[(n + i) * m + (m + j)]) {
				//cout << i + 1 << ' ' << j + 1 << endl;
				++Ans;
			}
		}
	}
	printf("%lld\n", Ans);
	return 0;
}