/*
#pragma GCC optimize("Ofast")
#pragma GCC target("avx,avx2,fma")
#pragma GCC optimize("unroll-loops")
*/
// lethal option

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

#define all(flg) flg.begin(), flg.end()
#define int long long
#define endl "\n"
#define eb emplace_back
#define ii pair<int, int>
#define vi vector<int>
#define ll long long
#define ld long double
const ll mod = (ll)1e18 + 31;
const int maxN = 5e5 + 5;
const ll oo = 1e18 + 7;
int n, a[maxN];

mt19937 rng(chrono::steady_clock::now().time_since_epoch().count());

int x, y, z, k, m, o;

int pw2[maxN];

int res[maxN];

void solve(){
	memset(res, 0, sizeof(res));
	pw2[0] = 1;
	for(int i = 1; i <= 205; ++i){
		pw2[i] = pw2[i - 1] * 2 % mod;
	}
	cin >> n >> k >> m >> o;
	for(int i = 0; i < k; ++i){
		for(int j = 1; j <= m; ++j){
			cin >> x; res[x] = (res[x] + pw2[i]) % mod;
		}
	}
	vector<ii> holder;
	holder.push_back({-1, -1});
	holder.push_back({mod, mod});
	for(int i = 1; i <= n; ++i){
		holder.push_back({res[i], i});
	}
	sort(all(holder));
	while(o--){
		string s; cin >> s;
		int comp = 0;
		for(int i = 0; i < k; ++i){
			if(s[i] == 'Y') comp = (comp + pw2[i]) % mod;
		}
		int id = lower_bound(all(holder), ii(comp, -1ll)) - holder.begin();
		if(id == holder.size() - 1 || id == 0) cout << 0 << endl;
		else if(holder[id].first != comp) cout << 0 << endl;
		else if(holder[id].first == holder[id - 1].first || 
				holder[id].first == holder[id + 1].first) cout << 0 << endl;
		else cout << holder[id].second << endl;
	}
}

signed main(){
	if(fopen("cf.inp", "r")){  
		// freopen("cf.inp", "r", stdin);  
		// freopen("cf.out", "w", stdout);
	}
	ios_base::sync_with_stdio(0);
	cin.tie(NULL);
	cout.tie(NULL);
	int o = 1; 
	while(o--){
		solve();
	}
}