#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 MOD = 1e16 + 7, BASE = 31;

struct Hashstr {
    std::vector<long long> p, h;

    Hashstr(std::string &s) {
        int n = s.size();
        p.resize(n + 1);
        p[0] = 1;
        for (int i = 1; i <= n; i++) p[i] = p[i - 1] * BASE % MOD;
        h.resize(n + 1);
        h[0] = 0;
        for (int i = 1; i <= n; i++)
            h[i] = (h[i - 1] * BASE + (s[i - 1] ^ 7)) % MOD;
    }

    long long query(int l, int r) {
        return (h[r] - h[l - 1] * p[r - l + 1] % MOD + MOD) % MOD;
    }
};

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].query(st, mid) != T.query(st, mid)) r = mid;
                    else l = mid + 1;
                }
                st = l + 1;
            }
            if(st > m || S[i].query(st, m) == T.query(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;
}