#include<cstdio>
#include<queue>
#include<utility>
using namespace std;
const int o=1e5+10;const long long inf=2e18;
int n,q,v[o],c[o],p=1;long long f[o],V;bool vis[o];priority_queue<pair<long long,int> > Q;
int main(){
	scanf("%d%d",&n,&q);
	for(int i=1;i<=n;++i){
		scanf("%d%d",&v[i],&c[i]);
		if(c[i]*1ll*v[p]>c[p]*1ll*v[i]) p=i;
	}
	for(int i=0;i<v[p];++i) f[i]=-inf;
	for(Q.push(make_pair(f[0]=0,0));!Q.empty();){
		int t=Q.top().second;
		Q.pop();
		if(vis[t]) continue;
		vis[t]=1;
		for(int i=1;i<=n;++i) if(f[(t+v[i])%v[p]]<f[t]+c[i]-(t+v[i])/v[p]*1ll*c[p])
			Q.push(make_pair(f[(t+v[i])%v[p]]=f[t]+c[i]-(t+v[i])/v[p]*1ll*c[p],(t+v[i])%v[p]));
	}
	for(;q--;printf("%lld\n",(f[V%v[p]]>-inf)?V/v[p]*c[p]+f[V%v[p]]:-1)) scanf("%lld",&V);
	return 0;
}