// what is matter? never mind. 
//#pragma GCC optimize("Ofast")
//#pragma GCC optimize("unroll-loops")
//#pragma GCC target("sse,sse2,sse3,sse4,popcnt,abm,mmx,avx,avx2")
#include<bits/stdc++.h>
#define For(i,a,b) for(int i=(a);i<=(b);++i)
#define Rep(i,a,b) for(int i=(a);i>=(b);--i)
#define ll long long
//#define ull unsigned long long
#define int long long
#define SZ(x) ((int)((x).size()))
#define ALL(x) (x).begin(),(x).end()
using namespace std;
inline int read()
{
	char c=getchar();int x=0;bool f=0;
	for(;!isdigit(c);c=getchar())f^=!(c^45);
	for(;isdigit(c);c=getchar())x=(x<<1)+(x<<3)+(c^48);
	return f?-x:x;
}

#define fi first
#define se second
#define pb push_back
#define mkp make_pair
typedef pair<int,int>pii;
typedef vector<int>vi;

#define maxn 2000005
#define inf 0x3f3f3f3f

int m;
struct node{
	int l,r,x;
	int sum,cnt;
};
node st[maxn];
int tp;
int S(int n){
	return n*(n-1)/2;
}
node gen(int sum,int cnt){
	node t;
	t.sum=sum,t.cnt=cnt;
	
	sum-=S(cnt);
	t.l=sum/cnt;
	sum-=t.l*cnt;
//	cout<<"now_sum "<<sum<<" "<<t.l<<endl;
	if(sum<0) t.l--,sum+=cnt;
	if(sum==0) t.x=-1,t.r=t.l+cnt-1;
	else t.r=t.l+cnt,t.x=t.r-sum;
	
	return t;
}

int pre[maxn];

signed main()
{
	m=read();
	
	node t=gen(17,5);
//	cout<<"?? "<<t.l<<" "<<t.r<<" "<<t.x<<endl;
	
	For(i,1,m){
		int x=read(),c=read();
		node t=gen(x*c,c);
		while(tp && st[tp].r>=t.l){
			t=gen(st[tp].sum+t.sum,st[tp].cnt+t.cnt);
			--tp;
		}
		st[++tp]=t;
	}
	For(i,1,tp) pre[i]=pre[i-1]+(st[i].r-st[i].l+1-(st[i].x!=-1));
	
//	For(i,1,tp) cout<<"range "<<st[i].l<<" "<<st[i].r<<" "<<st[i].x<<endl;
	
	int q=read();
	For(i,1,q){
		int k=read();
		int p=lower_bound(pre+1,pre+tp+1,k)-pre;
		k-=pre[p-1];
		int res=0;
		
		res=st[p].l+k-1;
		if(st[p].x!=-1 && res>=st[p].x)++res;
		printf("%lld\n",res);
	}
    return 0;
}
/*
9 8


9 105
801 919 210 101 417 713 304 613 921
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 2 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1 1


1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 2 1 0
1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 1 0 1 1

1 1 1 1
1 1 2 1

1 1 1 0 0 1 1 0

0 1 1 1 1 1 1 4 4 5 8 9 9 
*/