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

#define rep(i,a,b) for(int i=(int)a; i<(int)b; i++)
#define Int long long
#define V vector

void solve();
signed main(){
	solve();
}

const int N = 5e5+5;

int n, k, m, f;
Int hk[N], hsh[N];

map<Int,V<int>> mp;

void solve(){
	srand(time(0));

	cin >> n >> k >> m >> f;

	// apply hash of each card to each value
	rep(i,0,k){
		hk[i] = (0LL+rand())<<32|rand();

		set<int> s;
		rep(j,0,m){
			int x;
			cin >> x;

			if(s.count(x)) continue;
			s.insert(x);
			hsh[x] ^= hk[i];
		}
	}

	// hash of each value
	rep(x,1,n+1){
		// cerr << x << " " << hsh[x] << endl;
		mp[hsh[x]].push_back(x);
	}

	// solve query
	rep(i,0,f){
		string s;
		cin >> s;

		Int curhsh = 0;
		rep(j,0,k) if(s[j]=='Y'){
			curhsh ^= hk[j];
		}
		// cerr << "curhsh " << curhsh << endl;

		V<int>& v = mp[curhsh];
		// cerr << "v[] "; for(int y : v) cerr << y << " "; cerr << endl;
		if(v.size()!=1){
			cout << 0 << '\n';
		}
		else{
			cout << v[0] << '\n';
		}
	}
}