#include<bits/stdc++.h>

typedef long long int ll;
typedef unsigned long long int ull;
#define pii pair<int,int>
#define YES cout<<"YES\n"
#define Yes cout<<"Yes\n"
#define yes cout<<"yes\n"
#define NO cout<<"NO\n"
#define No cout<<"No\n"
#define no cout<<"no\n"
#define pb push_back
#define lowbit(x) ((x) & (-x))

using namespace std;
const int INF = 0x3f3f3f3f;
const double EPS=1e-10;
const double Pi=3.1415926535897;
const int mod=1e9+7;
const int maxn=305;

int n,q,m,k;
string s[maxn];
string T;
struct Hash{
	#define ull unsigned long long
	const int p=131;
	vector<ull>base,has;
	Hash(string s) {
		int n=s.length();
		base.resize(n+1,1);
		has.resize(n+1,0);
		for (int i=1;i<=n;i++) base[i]=base[i-1]*p;
		for (int i=1;i<=n;i++) has[i]=has[i-1]*p+s[i-1];
	}
	ull calc(int l,int r) {
		return has[r]-base[r-l+1]*has[l-1];
	}
};

struct Hash1{
	#define ull unsigned long long
	const int p=131;
	const int mod=469762049;
	vector<ull>base,has;
	Hash1(string s) {
		int n=s.length();
		base.resize(n+1,1);
		has.resize(n+1,0);
		for (int i=1;i<=n;i++) base[i]=base[i-1]*p%mod;
		for (int i=1;i<=n;i++) has[i]=(has[i-1]*p%mod+s[i-1])%mod;
	}
	ull calc(int l,int r) {
		return (has[r]-base[r-l+1]*has[l-1]%mod+mod)%mod;
	}
};

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0),cout.tie(0);
	
	cin>>n>>q>>m>>k;
	//vector<Hash>h;
	vector<Hash1>h1;
	for(int i=1;i<=n;i++){
		cin>>s[i];
		//h.pb(Hash(s[i]));
		h1.pb(Hash1(s[i]));
	}
	
	for(int i=1;i<=q;i++){
		cin>>T;
		//Hash t=Hash(T);
		Hash1 t1=Hash1(T);
		int ans=0;
		for(int j=0;j<n;j++){
			int cur=1;
			for(int o=1;o<=k+1;o++){
				int l=cur-1,r=m+1;
				while(r-l>1){
					int mid=(l+r)/2;
					if(//h[j].calc(cur,mid)==t.calc(cur,mid) &&
						h1[j].calc(cur,mid)==t1.calc(cur,mid)) l=mid;
					else r=mid;
				}
				cur=r+1;
				if(cur>=m+2){
					//cout<<T<<" "<<s[j+1]<<"\n";
					ans++;
					break;
				}
			}
		}
		cout<<ans<<"\n";
	}
	

	return 0;
}

/*

*/