#include<bits/stdc++.h>
#define rep2(i,j,k) for(ll i = ll(j); i < ll(k); i++)
#define rep(i,k) rep2(i,0,k)
#define rrep2(i,j,k) for(ll i = ll(j)-1; i >= ll(k); i--)
#define rrep(i,k) rrep2(i,k,0)
#define eb emplace_back
#define SZ(a) ll(a.size())
#define all(a) a.begin(),a.end()
using namespace std;
using ll = long long;
using P = pair<ll,ll>;
using vl = vector<ll>;
using vvl = vector<vl>;
using vp = vector<P>;
using vvp = vector<vp>;
const ll inf = LLONG_MAX/4;
bool chmin(auto& a, auto b) {return a>b ? a=b, 1 : 0;}
bool chmax(auto& a, auto b) {return a<b ? a=b, 1 : 0;}

int main(){
	cin.tie(0) -> sync_with_stdio(0);
	ll n,k,m,f; cin >> n >> k >> m >> f;
	const ll M = 5e5+10;
	vector<bitset<M>> state(k);
	vector<bitset<M>> rev(k);
	rep(i,k){
		rep(j,m){
			ll x; cin >> x;
			state[i].set(x-1);
		}
		rev[i] = state[i];
		rep(j,n) rev[i].flip(j);
	}

	auto calc = [&](ll idx, char v){
		if(v == 'Y') return state[idx];
		else return rev[idx];
	};

	while(f--){
		string s; cin >> s;
		bitset<M> ans = calc(0, s[0]);	
		rep(i,k){
			ans &= calc(i, s[i]);
		}
		if(ans.count() != 1){
			cout << 0 << "\n";
		}
		else{
			ll val = ans._Find_first();
			cout << ans._Find_first() + 1 << "\n";
		}
	}
}