#include<iostream>
#include<cstdio>
#include<algorithm>
#include<cstring>
using namespace std;
struct ddd{
	int id;
	int wei;
	int fang;
}a[110000],after[110000];
int shun[110000];
int n,m,l,t;
bool compare(ddd x,ddd y){
	return (x.wei<y.wei);
}
int main(){
	freopen("dcball.in","r",stdin);
	freopen("dcball.out","w",stdout);
	cin>>n>>l;
	for(int i=1;i<=n;i++){
		scanf("%d%d",&a[i].wei,&a[i].fang);
		a[i].id=i;
	}
	cin>>m;
	sort(a+1,a+n+1,compare);
	for(int i=1;i<=n;i++)
		shun[a[i].id]=i;
	for(int i=1;i<=m;i++){
		scanf("%d",&t);
		for(int i=1;i<=n;i++){
			if(a[i].fang)
				after[i].wei=a[i].wei-t;
			else
				after[i].wei=a[i].wei+t;
		}
		sort(after+1,after+n+1,compare);
		for(int i=1;i<=n;i++){
			if(after[shun[i]].wei<1||after[shun[i]].wei>l)
				printf("fire in the hole ");
			else
				printf("%d ",after[shun[i]].wei);
		}
		printf("\n");
	}
	return 0;
}