#include <bits/stdc++.h>
using namespace std;
#define N (int)2e5 + 5
#define pdd pair<double, double>
#define pii pair<int, int>

int a, b, c, d, x, y, n, m, t, k, q, l, r, z, h;
string s;
struct node {
    int son[27];
    int end = 0;
};
node tree[5000005];
int tot = 0;
void insert(string word) {
    int p = 0;
    for (char i : word) {
        int idx = i - 'a';
        if (tree[p].son[idx] == 0) tree[p].son[idx] = ++tot;
        p = tree[p].son[idx];
    }
    tree[p].end++;
}
int dfs(int now, int i, int kk) {
    if (i == m) return tree[now].end;
    int ans = 0;
    if (tree[now].son[s[i]-'a']) ans += dfs(tree[now].son[s[i]-'a'], i + 1, kk);
    if (kk) {
        for (int j = 0; j < 27; j++) {
            if (j == s[i]-'a') continue;
            if (tree[now].son[j]) ans += dfs(tree[now].son[j], i + 1, kk - 1);
        }
    }
    return ans;
}
int main() {
	ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
	// 注意根据数据量调整N的大小
        cin >> n >> q >> m >> k;
        for (int i = 1; i <= n; i++) cin >> s, insert(s);
        while (q--) {
            cin >> s;
            cout << dfs(0, 0, k) << '\n';
        }
	return 0;
}