#include<bits/stdc++.h>
#define int long long

const int base = 199,mod1 = 1e11 + 1111,mod2 = 1e15 + 1551,N = 1e6 + 6;
int powb[N];

int Hash(std::string &s,std::vector<int> &hs,int m)
{
    hs[m] = s[m];
    for(int i = m - 1;i >= 0;--i)
        hs[i] = (hs[i + 1] * base + s[i]) % mod1;
    return hs[0];
}

int getnum(std::vector<int> &H,int L,int R)
{
    return (H[L] - H[R + 1] * powb[R - L + 1] % mod1 + mod1) % mod1;
}

int check(std::vector<int>& H,std::vector<int> &h,int k,int i)
{
    //std::cout<<k<<" "<<i<<"\n";
    if(k < 0)return 0;
    int L = i,R = H.size();

    while(R - L > 1)
    {
        int mid = (L + R) >> 1;
        //std::cout<<L<<" "<<mid<<" "<<R<<"\n";
        if(mid == H.size() - 1){
            if(H[i + 1] == h[i + 1])L = mid;else R = mid;
        }
        if(mid != H.size() - 1){
            if(getnum(H,i + 1,mid) == getnum(h,i + 1,mid))L = mid;else R = mid;
        }
    }

    if(R != H.size())return check(H,h,k-1,R);
    return 1;
}

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

    powb[0] = 1;
    for(int i = 1;i<N;++i)powb[i] = powb[i - 1] * base % mod1;

    int n,q,m,k;
    std::cin>>n>>q>>m>>k;

    std::vector<int> h(m+1,0);
    std::vector<std::vector<int>> H(n+1,std::vector<int>(m+1,0));
    for(int i = 1;i<=n;++i)
    {
        std::string s;
        std::cin>>s;
        s = "!" + s;
        Hash(s,H[i],m);
    }

    for(int qi = 1;qi<=q;++qi)
    {
        std::string s;
        std::cin>>s;
        s = "!" + s;
        for(int i = 0;i<=m;++i)h[i] = 0;
        Hash(s,h,m);

        int ans = 0;

        for(int i = 1;i<=n;++i)ans += check(H[i],h,k,0);

        std::cout<<ans<<"\n";
    }

    return 0;
}