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

#pragma GCC optimize("Ofast")
#pragma GCC target("avx2")

using ll = long long;
using pii = pair<int, int>;

void solve(int TC) {
	int n, k, m, f;
	cin >> n >> k >> m >> f;
	
	vector<vector<int>> a(n + 1);


	for (int i = 1; i <= k; i++) {
		for (int j = 1; j <= m; j++) {
			int x;
			cin >> x;
			a[x].push_back(i);
		}
	}

	map<string, vector<int>> M;

	for (int i = 1; i <= n; i++) {
		int pnt = 0;
		string s = "";
		for (int j = 1; j <= k; j++) {
			if (pnt < a[i].size()) {
				if (j == a[i][pnt]) {
					s += "Y";
					++pnt;
				}
				else s += "N";
			}
			else {
				s += "N";
			}
		}
		M[s].push_back(i);
	}

	for (int i = 1; i <= f; i++) {
		string s;
		cin >> s;
		if (M.count(s)) {
			auto &v = M[s];
			if (v.size() == 1) {
				cout << v[0] << "\n";
			}
			else {
				cout << "0\n";
			}
		}
		else {
			cout << "0\n";
		}
	}
}

int32_t main() {
	cin.tie(0)->sync_with_stdio(0);
	cout << fixed << setprecision(10);

	int t = 1;
	// cin >> t;

	for (int i = 1; i <= t; i++) {
		solve(i);
	}
}