#include <bits/stdc++.h>
using namespace std;
#define endl '\n'
#define int long long
const int N = 1e6 + 10;
const int M = 2e5 + 10;
typedef unsigned long long ull;
typedef long long ll;
typedef pair<int, int> PII;
// const int mod = 998244353;
const int INF = 1e9;
const double eps = 1e-6;
int p = 131;
const int mod = 1e9 + 7;
string s[310];
int hsh[310][60010];
int h[60010];
int pp[60010];
void hashe(string s, int x)
{
    int l = s.size();
    for (int i = 1; i < l; i++)
        hsh[x][i] = (hsh[x][i - 1] * p % mod + s[i] + mod) % mod;
}
void hashe1(string s)
{
    int l = s.size();
    for (int i = 1; i < l; i++)
        h[i] = (h[i - 1] * p % mod + s[i] + mod) % mod;
}
int getss(int l, int r, int i)
{
    return (hsh[i][r] - hsh[i][l - 1] * pp[r - l + 1] % mod + mod) % mod;
}
int gett(int l, int r)
{
    return (h[r] - h[l - 1] * pp[r - l + 1] % mod + mod) % mod;
}
bool check(int l, int r, int i)
{
    return gett(l, r) == getss(l, r, i);
}
void solve()
{
    int n, q, m, k;
    cin >> n >> q >> m >> k;
    pp[0] = 1;
    for (int i = 1; i <= m; i++)
        pp[i] == pp[i - 1] * 131 % mod;
    for (int i = 1; i <= n; i++)
    {
        cin >> s[i];
        s[i] = " " + s[i];
        hashe(s[i], i);
    }
    // for (int i = 1; i <= n; i++)
    //     for (int j = 1; j <= m; j++)
    //         cout << hsh[i][j] << " \n"[j == m];
    while (q--)
    {
        string t;
        cin >> t;
        t = " " + t;
        hashe1(t);
        // for (int i = 1; i <= m; i++)
        //     cout << h[i] << " \n"[i == m];
        int ans = 0;
        for (int i = 1; i <= n; i++)
        {
            int f = 1;
            int now = 0;
            int tot = 0;
            for (int j = 1; j <= m; j++)
            {
                if (s[i][j] != t[j])
                {
                    tot++;
                    if (tot > k)
                    {
                        f = 0;
                        break;
                    }
                    now = j + 1;
                    continue;
                }
                int l = j, r = m;
                while (l < r)
                {
                    int mid = l + r + 1 >> 1;
                    if (check(now, mid, i))
                        l = mid;
                    else
                        r = mid - 1;
                }
                j = l;
            }
            if (f)
                ans++;
        }
        cout << ans << endl;
    }
}
signed main()
{
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout.tie(0);
    int T = 1;
    // cin >> T;
    while (T--)
        solve();
    return 0;
}