#include<bits/stdc++.h>
#define fi first
#define se second
#define pb push_back
#define ii pair<int, int>
#define sz(v) (int)v.size()
#define all(v) v.begin(), v.end()
using namespace std;

const int N=1e5+5, mod = 1e9+7;

int n, k, m, q;

signed main() {
    ios_base::sync_with_stdio(0); cin.tie(0); cout.tie(0);
    cin >> n >> k >> m >> q;
    vector<__int128> msk(n+1);
    __int128 bs = 1;
    for (int i=0; i<k; i++) {
        for (int j=0; j<m; j++) {
            int x; cin >> x; x--;
            msk[x] |= bs;
        }
        bs<<=1;
    }

    vector<int> idx(n);
    for (int i=0; i<n; i++) idx[i] = i;
    sort(all(idx), [&](int x, int y){return msk[x] < msk[y];});
    __int128 tmp;
    while(q--) {
        string s; cin >> s;
        tmp = 0; bs = 1;
        for (int i=0; i<k; i++) {
            if(s[i]=='Y') tmp|=bs;
            bs<<=1;
        }
        msk[n] = tmp;

        int pos = lower_bound(all(idx), n, [&](int x, int y){return msk[x]<msk[y];})-idx.begin();

        if(pos==sz(idx) || (pos+1<sz(idx) && msk[idx[pos]]==msk[n] && msk[idx[pos+1]]==msk[n])) cout << "0\n";
        else cout << idx[pos]+1 << '\n';
    }
}