#include <bits/stdc++.h>

using namespace std;
using ll = long long;
// #define int ll
using PII = pair<ll, ll>;

#define FOR(i, a, n) for (ll i = (ll)a; i < (ll)n; ++i)
#define REP(i, n) FOR(i, 0, n)
#define ALL(x) x.begin(), x.end()

template<typename T> T &chmin(T &a, const T &b) { return a = min(a, b); }
template<typename T> T &chmax(T &a, const T &b) { return a = max(a, b); }
template<typename T> bool IN(T a, T b, T x) { return a<=x&&x<b; }
template<typename T> T ceil(T a, T b) { return a/b + !!(a%b); }

template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T,typename... Ts>
auto make_v(size_t a,Ts... ts) {
    return vector<decltype(make_v<T>(ts...))>(a,make_v<T>(ts...));
}
template<typename T,typename V> typename enable_if<is_class<T>::value==0>::type
fill_v(T &t, const V &v) { t=v; }
template<typename T,typename V> typename enable_if<is_class<T>::value!=0>::type
fill_v(T &t, const V &v ) { for(auto &e:t) fill_v(e,v); }

template<class S,class T>
ostream &operator <<(ostream& out,const pair<S,T>& a) {
    out<<'('<<a.first<<','<<a.second<<')'; return out;
}
template<class T>
ostream &operator <<(ostream& out,const vector<T>& a){
    out<<'[';
    for(const T &i: a) out<<i<<',';
    out<<']';
    return out;
}
template<class T>
ostream &operator <<(ostream& out, const set<T>& a) {
    out<<'{';
    for(const T &i: a) out<<i<<',';
    out<<'}';
    return out;
}
template<class T, class S>
ostream &operator <<(ostream& out, const map<T,S>& a) {
    out<<'{';
    for(auto &i: a) out<<i<<',';
    out<<'}';
    return out;
}

int dx[] = {0, 1, 0, -1}, dy[] = {1, 0, -1, 0}; // DRUL
const int INF = 1<<30;
const ll LLINF = 1LL<<60;
const ll MOD = 1000000007;

using C = complex<double>;
void fft(vector<C> &f, bool inv = false) {
    const int n = f.size();
    const double PI = (inv ? -1 : 1) * acos(-1);
    for(int i=0, j=1; j+1<n; j++) {
        for(int k = n>>1; k>(i^=k); k>>=1);
        if(i>j) swap(f[i], f[j]);
    }
    C pow_zeta, zeta, a, b;
    for(int i=1; i<n; i<<=1) {
        zeta = polar(1.0, PI/i);
        for(int j=0; j<n; j+=i<<1) {
            pow_zeta = 1.0;
            for(int k=0; k<i; k++) {
                a = f[j+k],
                b = C(f[j+k+i].real()*pow_zeta.real()-f[j+k+i].imag()*pow_zeta.imag(),f[j+k+i].real()*pow_zeta.imag()+f[j+k+i].imag()*pow_zeta.real());
                f[j+k] = a+b, f[j+k+i] = a-b;
                pow_zeta *= zeta;
            }
        }
    }
    if(inv) {
        double temp = 1.0/n;
        REP(i, n) f[i] *= temp;
    }
}
vector<ll> convolution(vector<ll> x, vector<ll> y) {
    const int xs = x.size(), ys = y.size();
    int n = 1;
    while(n < xs+ys-1) n <<= 1;
    vector<C> f(n), g(n);
    REP(i, xs) f[i] = x[i];
    REP(i, ys) g[i] = y[i];
    fft(f); fft(g);
    REP(i, n) f[i] *= g[i];
    fft(f, true);
    vector<ll> ret(xs+ys-1);
    REP(i, xs+ys-1) ret[i] = f[i].real() + 0.5;
    return ret;
}

signed main(void)
{
    cin.tie(0);
    ios::sync_with_stdio(false);

    ll n, m, k, l;
    cin >> n >> m >> k >> l;
    vector<string> vs(n);
    REP(i, n) cin >> vs[i];
    string s;
    cin >> s;

    const ll len = 512;
    vector<ll> a(len*len), b(len*len);
    REP(i, n) REP(j, n) a[i*len+j] = vs[i][j]=='X';
    ll mx = 0, my = 0;
    REP(i, s.size()) {
        if(s[i]=='U') my--;
        else if(s[i]=='D') my++;
        else if(s[i]=='L') mx--;
        else if(s[i]=='R') mx++;
        b[my*len+mx]++;
    }

    ll ans = 0;
    auto ret = convolution(a, b);
    REP(i, len*len) if(ret[i] >= k) ans++;
    cout << ans << endl;

    return 0;
}



Measured memory_bytes: 32716