#include<bits/stdc++.h>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;

const ull P = 131;

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

	int n, q, m, K;
	cin >> n >> q >> m >> K;
	vector<string> s(n);
	for(int i = 0; i < n; i ++ ) cin >> s[i];

	vector<ull> p(m + 2);
	p[0] = 1;
	for(int i = 1; i <= m + 1; i ++ ) {
		p[i] = p[i - 1] * P;
	}
	vector<vector<ull>> prehs(n, vector<ull> (m + 2, 0)), sufhs(n, vector<ull> (m + 2, 0));
	for(int i = 0; i < n; i ++ ) {
		for(int j = 0; j < m; j ++ ) {
			prehs[i][j + 1] = prehs[i][j] * P + s[i][j];
		}
		for(int j = m - 1; j >= 0; j -- ) {
			sufhs[i][j + 1] = sufhs[i][j + 2] * P + s[i][j];
		}
	}

	auto geths = [&](int id, int l, int r) -> ull {
		return prehs[id][r] - prehs[id][l - 1] * p[r - l + 1];
	};

	while(q -- ) {
		string str;
		cin >> str;
		vector<ull> pre(m + 2, 0), suf(m + 2, 0);
		for(int j = 0; j < m; j ++ ) {
			pre[j + 1] = pre[j] * P + str[j];
		}
		for(int j = m - 1; j >= 0; j -- ) {
			suf[j + 1] = suf[j + 2] * P + str[j];
		}

		auto geths_ = [&](int l, int r) -> ull {
			return pre[r] - pre[l - 1] * p[r - l + 1];
		};

		int ans = 0;
		for(int i = 0; i < n; i ++ ) {
			int l = 1, r = m, last = 0;
			for(int j = 0; j < K; j ++ ) {
				l = last + 1, r = m;
				while(l < r) {
					int mid = (l + r) >> 1;
					if(geths(i, last + 1, mid) != geths_(last + 1, mid)) r = mid;
					else l = mid + 1;
				}
				// cout << "ooo  " << str << ' ' << i << ' ' << l << '\n';
				if(geths(i, last + 1, l) != geths_(last + 1, l)) {
					last = l;
				} else {
					break;
				}
			}
			// cout << "ooo  " << str << ' ' << i << ' ' << last << '\n';
			if(last + 1 > m || sufhs[i][last + 1] == suf[last + 1]) {
				ans += 1;
			}
		}
		cout << ans << '\n';
	}

	return 0;
}