/*
Things to notice:
1. do not calculate useless values
2. do not use similar names
 
Things to check:
1. submit the correct file
2. time (it is log^2 or log)
3. memory
4. prove your naive thoughts 
5. long long
6. corner case like n=0,1,inf or n=m
7. check if there is a mistake in the ds or other tools you use
8. fileio in some oi-contest

9. module on time 
10. the number of a same divisor in a math problem
11. multi-information and queries for dp and ds problems
*/
#include<bits/stdc++.h>
using namespace std;
#define fi first
#define se second
#define pii pair<int,int>
#define mp make_pair
#define pb push_back
const int mod=998244353;
const int inf=0x3f3f3f3f;
const int B=500;
const int M=250000; 
vector <int> buc[250005];
int n,Q,ans[250005],X[250005],col[250005],uidx,id[250005];
bitset <250005> has[505],ok,now;
void solve()
{
	cin>>n>>Q;
	for(int i=1;i<=n;i++) cin>>X[i]>>col[i],has[0][X[i]]=1,buc[col[i]].pb(i);
	for(int i=1;i<=M;i++) if(buc[i].size()>B) 
	{
		id[i]=++uidx;
		for(int j=1;j<=n;j++) if(col[j]!=i) has[uidx][X[j]]=1;
	}
	now=has[0];
	for(int i=1;i<=n;i++)
	{
		int r=2*i;
		r=min(r,n);
		ok.reset();
		for(int j=i;j<=r;j++)
		{
			
			if(buc[col[j]].size()<=B)
			{
				for(int l=0;l<buc[col[j]].size();l++) now[X[buc[col[j]][l]]]=0;
			}
			else swap(now,has[id[col[j]]]);
			ok|=(now>>X[j]);
			if(buc[col[j]].size()<=B)
			{
				for(int l=0;l<buc[col[j]].size();l++) now[X[buc[col[j]][l]]]=1;
			}
			else swap(now,has[id[col[j]]]);
		}
		for(int j=1;j<=M;j++) if(!ans[j]&&ok[j]) ans[j]=i; 
		i=r;
	}
	while(Q--)
	{
		int x;
		cin>>x;
		cout<<ans[x]<<"\n";
	}
}
signed main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	int _=1;
//	cin>>_;
	while(_--) solve();
	return 0;
}