#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef pair<int, int> pii;

inline int rd() {
	int x = 0;
	bool f = 0;
	char c = getchar();
	for (; !isdigit(c); c = getchar()) f |= (c == '-');
	for (; isdigit(c); c = getchar()) x = x * 10 + (c ^ 48);
	return f ? -x : x;
}

template<typename T>
inline bool getmin(T &a, T b) {return a > b ? (a = b, true) : false;}

#define N 1007

pair<int, char> hint[N];

int y[N], h[N], tot;

struct segpair{
	int l, r, h;
	inline bool operator < (const segpair &obj) const {return r < obj.r;}
} s[N];

map<int, char> f;

int main() {
	int n = rd(), a = rd(), b = rd(), q = rd();
	for (int i = 1; i <= a; ++i) {
		int p = rd();
		char c = getchar();
		while (!isalpha(c)) c = getchar();
		hint[i] = {p, c};
	}
	for (int i = 1; i <= b; ++i) {y[i] = rd(); h[i] = rd();}
	y[b + 1] = n + 1;
	for (int i = 1; i <= b; ++i) if (h[i]) s[++tot] = {y[i], y[i + 1] - 1, h[i]};
	
	auto find = [&](int p) {
		if (!tot) return p;
		for (int i = tot; i; --i) {
			if (p > s[i].r) return p;
			if (p < s[i].l) continue;
			p = s[i].h + (p - s[i].h) % (s[i].l - s[i].h);
		}
		return p;
	};

	for (int i = 1; i <= a; ++i) f[find(hint[i].first)] = hint[i].second;
	for (int i = 1; i <= q; ++i) {
		int pos = find(rd());
		putchar(f.find(pos) == f.end() ? '?' : f[pos]);
	}
	return 0;
}