#include <iostream>
#include <cstdio>
#include <algorithm>
using namespace std;
const int maxn = 1e4 + 10;

struct Ant {
	int pos, id, dir;
	
	bool operator < (const Ant &b) const {
		return pos < b.pos;
	}
} as[maxn], mv[maxn];

int n, l, m;
int rank[maxn];

inline void read() {
	scanf("%d %d", &n, &l);
	for (int i = 1; i <= n; i++) {
		as[i].id = i;
		scanf("%d %d", &as[i].pos, &as[i].dir);
	}
}

inline void solve() {
	sort(as + 1, as + n + 1);
	for (int i = 1; i <= n; i++) rank[as[i].id] = i;
	int t;
	
	scanf("%d", &m);
	for (int i = 1; i <= m; i++) {
		scanf("%d", &t);
		for (int i = 1; i <= n; i++) mv[i].pos = as[i].pos + (as[i].dir ? -t : t);
		
		sort(mv + 1, mv + n + 1);
		
		for (int i = 1; i <= n; i++) {
			int id = rank[i];
			
			if (mv[id].pos < 1 or mv[id].pos > l) printf("fire in the hole ");
			else printf("%d ", mv[id].pos);
		}
		printf("\n");
	}
}

int main() {
	freopen("dcball.in", "r", stdin);
	freopen("dcball.out", "w", stdout);
	read();
	solve();
	return 0;
}