#include <bits/stdc++.h>

#ifndef LOCAL
#pragma GCC optimize("O3")
#pragma GCC target("avx2")
#endif

#define sz(v) ((int)v.size())
#define all(v) v.begin(), v.end()
#define pb push_back
#define pi array<int, 2>

using namespace std;

#define int long long

signed main(){
    ios_base::sync_with_stdio(false);
    cin.tie(0);
    
    int n, k, m, f;
    cin >> n >> k >> m >> f;
    vector<__int128> val(n + 1);
    __int128 bt = 1;
    for(int i = 0; i < k; ++i){
        for(int j = 0; j < m; ++j){
            int x; cin >> x; --x;
            val[x] += bt;
        }
        bt += bt;
    }

    vector<int> id(n);
    iota(all(id), 0);
    sort(all(id), [&](int x, int y){return val[x] < val[y];});
    while(f--){
        string s; cin >> s;

        __int128 sv = 0;
        bt = 1;
        for(int i = 0; i < k; ++i){
            if(s[i] == 'Y') sv += bt;
            bt += bt;
        }
        val[n] = sv;

        int p = lower_bound(all(id), n, [&](int x, int y){return val[x] < val[y];}) - id.begin();

        if(p == sz(id) || (p + 1 < sz(id) && val[id[p]] == val[n] && val[id[p + 1]] == val[n])){
            cout << "0\n";
        }
        else{
            cout << id[p] + 1 << '\n';
        }
    }

    return 0;
}