#include<bits/stdc++.h>
#define x first
#define y second
using namespace std;

using i64 = long long;
using u32 = unsigned int;
using u64 = unsigned long long;
using i128 = __int128;

const int N = 1000010,M = 200010,mod = 1e9+7,INF = 0X3f3f3f3f;

mt19937_64 rnd(chrono::duration_cast<chrono::nanoseconds>(chrono::system_clock::now().time_since_epoch()).count());

int Tn,n,q,m,k;
string s;
int x[N << 1],y[N],c[N],sa[N],rk[N],height[N],mn[N][25],mylog2[N];
//sa[i]表示排序为i的后缀编号
//rk[i]表示后缀i的排名
//height[i] = lcp(sa[i],sa[i - 1]) 第i名后缀与第i-1名后缀的最长公共前缀的长度

//空间够的话开两倍空间，这个模板有点丑会越界

void get_sa() {
	int i,j,k;
	for (i = 1;i <= n;i++) {
		c[x[i] = s[i]] ++;
		m = max(m,(int)s[i]);
	}
	for (i = 1;i <= m;i++) {
		c[i] += c[i - 1];
	}
	for (i = n;i >= 1;i--) {
		sa[c[x[i]]--] = i;
	}
	// cerr << m << "\n";

	for (k = 1;k <= n;k <<= 1) {
		for (i = 0;i <= m;i++) c[i] = 0;
		for (i = 1;i <= n;i++) {
			y[i] = sa[i];
		}
		for (i = 1;i <= n;i++) {
			c[x[y[i] + k]]++;
		}
		for (i = 1;i <= m;i++) {
			c[i] += c[i-1];
		}
		for (i = n;i >= 1;i--) {
			sa[c[x[y[i] + k]]--] = y[i]; //x[y[i] + k] 会越界
		}

		for (i = 0;i <= m;i++) c[i] = 0;
		for (i = 1;i <= n;i++) {
			y[i] = sa[i];
		} 
		for (i = 1;i <= n;i++) {
			c[x[y[i]]]++; 
		}
		for (i = 1;i <= m;i++) {
			c[i] += c[i-1];
		}
		for (i = n;i >= 1;i--) {
			sa[c[x[y[i]]]--] = y[i]; 
		}

		for (i = 1;i <= n;i++) {
			y[i] = x[i];
		}
		for (m = 0,i = 1;i <= n;i++) {
			if (y[sa[i]] == y[sa[i-1]] && y[sa[i] + k] == y[sa[i-1] + k]) x[sa[i]] = m;
			else x[sa[i]] = ++m;
		}
		if (m == n) break;
	} 
}

void get_height() {
	for (int i = 1;i <= n;i++) {
		rk[sa[i]] = i;
	}
	for (int i = 1,k = 0;i <= n;i++) {
		if (rk[i] == 1) continue;
		if (k) k--;
		int j = sa[rk[i] - 1];
		while (i + k <= n && j + k <= n && s[i + k] == s[j + k]) k++;
		height[rk[i]] = k;
	}

	for (int i = 1;i <= n;i++) {
		mn[i][0] = height[i];
	}
	for (int j = 1;j <= 24;j++) {
		for (int i = 1;i <= n - (1 << j) + 1;i++) {
			mn[i][j] = min(mn[i][j - 1],mn[i + (1 << j - 1)][j - 1]);
		}
	}
	mylog2[1] = 0;
	for (int i = 2;i < n;i++) {
		mylog2[i] = mylog2[i >> 1] + 1;
	}
}

//求后缀a和后缀b的lcp
int lcp(int a,int b) {
	a = rk[a], b = rk[b];
	if (a > b) swap(a,b);
	a += 1;
	int k = mylog2[b - a + 1];
	return min(mn[a][k],mn[b - (1 << k) + 1][k]);
}

//清空
void init(int n) {
	for (int i = 1;i <= 2 * n;i++) {
		x[i] = y[i] = sa[i] = rk[i] = height[i] = 0;
		memset(mn[i],0,sizeof mn[i]);
	}
	for (int i = 1;i <= 256;i++) {
		c[i] = 0;
	}
}

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

	cin >> Tn >> q >> m >> k;
	vector<string> S(Tn);
	for (int i = 0;i < Tn;i++) {
		cin >> S[i];
		// cerr << 
	}

	while (q--) {
		string t;
		cin >> t;
		int ans = 0;
		for (int i = 0;i < Tn;i++) {
			s = S[i] + t;
			s = " " + s;
			n = s.size() - 1;
			init(n);
			get_sa();
			get_height();

			int p = 1,q = n / 2 + 1;
			int cnt = 0;
			while (p <= n / 2 && q <= n && cnt <= k) {
				int same = lcp(p,q);
				if (same == 0) {
					cnt++;
					p++,q++;
					continue;
				}
				p = p + same + 1;
				q = q + same + 1;
				if (p <= n / 2 && q <= n) cnt++;
			}
			// cerr << "cnt = " << cnt << "\n";
			if (cnt <= k) ans++;
		}
		cout << ans << "\n";
	}

	return 0;
}