#include <bits/stdc++.h>

#define int long long

std::mt19937 rng(std::chrono::steady_clock::now().time_since_epoch().count());

int rnd(int x, int y) { return std::uniform_int_distribution<int>(x, y)(rng); }

int MOD1 = 2e15 + rnd(0, 1e13), BASE1 = 233 + rnd(0, 1e2);
int MOD2 = 2e15 + rnd(0, 1e14), BASE2 = 233 + rnd(0, 1e2);

struct Hashstr {
    std::vector<long long> p1, h1, p2, h2;

    Hashstr(std::string &s) {
        int n = s.size();
        p1.resize(n + 1);
        p2.resize(n + 1);
        p1[0] = 1;
        p2[0] = 1;
        for (int i = 1; i <= n; i++) p1[i] = p1[i - 1] * BASE1 % MOD1;
        for (int i = 1; i <= n; i++) p2[i] = p2[i - 1] * BASE2 % MOD2;

        h1.resize(n + 1);
        h2.resize(n + 1);
        h1[0] = 0;
        h2[0] = 0;

        for (int i = 1; i <= n; i++) {
            h1[i] = (h1[i - 1] * BASE1 + (s[i - 1] ^ 7)) % MOD1;
            h2[i] = (h2[i - 1] * BASE2 + (s[i - 1] ^ 13)) % MOD2;
        }
    }

    long long query1(int l, int r) {
        return (h1[r] - h1[l - 1] * p1[r - l + 1] % MOD1 + MOD1) % MOD1;
    }

    long long query2(int l, int r) {
        return (h2[r] - h2[l - 1] * p2[r - l + 1] % MOD2 + MOD2) % MOD2;
    }
};

void solve() {
    int n, q, m, k;
    std::cin >> n >> q >> m >> k;

    std::vector<Hashstr> S;

    for (int i = 0; i < n; i++) {
        std::string s;
        std::cin >> s;
        Hashstr t(s);
        S.emplace_back(t);
    }

    for (int __ = 0; __ < q; __++) {
        std::string t;
        std::cin >> t;
        Hashstr T(t);
        int ans = 0;
        for (int i = 0; i < n; i++) {
            int st = 1;
            for (int _ = 0; _ < k; _++) {
                int l = st, r = m;
                if (l > r) break;
                while (l < r) {
                    int mid = l + r >> 1;
                    if (S[i].query1(st, mid) != T.query1(st, mid) && S[i].query2(st, mid) != T.query2(st, mid))
                        r = mid;
                    else
                        l = mid + 1;
                }
                st = l + 1;
            }
            if (st > m || (S[i].query1(st, m) == T.query1(st, m) && S[i].query2(st, m) == T.query2(st, m))) ans++;
        }
        std::cout << ans << '\n';
    }
}

/*
6 4 4 1
kaki
kika
manu
nana
tepu
tero
kaka
mana
teri
anan

8 6 7 3
delphis
aduncus
peronii
plumbea
clymene
hectori
griseus
electra
delphis
helpiii
perphii
clumeee
eleelea
ddlpcus
*/

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

    int t = 1;
    // std::cin >> t;
    for (int i = 0; i < t; ++i) {
        solve();
    }

    return 0;
}