#include <bits/stdc++.h>
using namespace std;
#define int long long
mt19937_64 rng(std::chrono::system_clock::now().time_since_epoch().count());
signed main(){
	cin.tie(nullptr)->sync_with_stdio(false);
	int n,k,m,q;
	cin >> n >> k >> m >> q;
	vector<int>h(k+1);
	for(int i = 1; i<=k; i++){
		h[i] = rng();
	}
	vector<vector<int>>adj(n+1);
	for(int i = 1; i<=k; i++){
		set<int>s;
		for(int j = 1; j<=m; j++){
			int x;
			cin >> x;
			s.insert(x);
		}
		for(int nxt: s){
			adj[nxt].push_back(i);
		}
	}
	map<int,int>hm;
	map<int,int>bad;
	for(int i = 1; i<=n; i++){
		int hsh = 0;
		for(int nxt: adj[i]){
			hsh^=h[nxt];
		}
		if(hm.count(hsh)){
			bad[hsh] = 1;
		}
		else{
			hm[hsh] = i;
		}
	}
	while(q--){
		string s;
		cin >> s;
		s = " " + s;
		int hsh = 0;
		for(int i = 1; i<=k; i++){
			if(s[i]=='Y'){
				hsh^=h[i];
			}
		}
		if(bad[hsh] || !hm.count(hsh)){
			cout << "0\n";
		}
		else{
			cout << hm[hsh] << '\n';
		}
	}
	return 0;
}