#include <iostream>
#include <cstdio>
#include <cstring>
#include <cstdio>
#include <algorithm>
 
using namespace std;
 
const int maxn = 1500 + 100;
class kanato{
	public:
		int num, dir, pos;
}ant[maxn];
 
inline bool cmp(kanato a, kanato b){
	return a.pos < b.pos;
}
int main(){
	freopen("dcball.in", "r", stdin);
	freopen("dcball.out", "w", stdout);
	
	int n, l;cin>>n>>l;
	for(int i=1;i<=n;i++){
		cin>>ant[i].pos>>ant[i].dir;
		ant[i].num = i;
	}
	sort(ant+1, ant+1+n, cmp);
	int id[maxn];for(int i=1;i<=n;i++)id[ant[i].num] = i;
	int m;cin>>m;
	while(m--){
		kanato tmp[maxn];
		int t;cin>>t;
		for(int i=1;i<=n;i++){
			if(ant[i].dir==0)tmp[i].pos = ant[i].pos + t;
			else tmp[i].pos = ant[i].pos - t;
		}
		sort(tmp+1, tmp+1+n, cmp);
		for(int i=1;i<=n;i++){
			int cur = id[i];
			if(tmp[cur].pos<=0||tmp[cur].pos>l)cout<<"fire in the hole"<<' ';
			else cout<<tmp[cur].pos<<' ';
		}
		cout<<endl;
	}
	return 0;
}