#include<iostream>
#include<vector>
#include<cassert>
using namespace std;
int N;
long M;
long A[1<<17],B[1<<17];
int Q;
long X;
int C[1<<17];
long s(long a,long b,long n)
{
	long ret=a*n;
	ret+=n*(n-1)/2*b;
	return ret;
}
long f(int id,long R)
{
	if(A[id]>=R)
	{
		return s(A[id],B[id],M)-R*M;
	}
	else if(A[id]+(M-1)*B[id]<=R)
	{
		return R*M-s(A[id],B[id],M);
	}
	//A[id]+k*B[id]<=R
	//k<=(R-A[id])/B[id]
	long k=(R-A[id])/B[id];
	assert(0<=k&&k<M-1);
	long ret=0;
	ret+=R*(k+1)-s(A[id],B[id],k+1);
	ret+=s(A[id]+(k+1)*B[id],B[id],M-k-1)-R*(M-k-1);
	return ret;
}
long g(int i,int j)
{
	assert(i<j);
	assert(A[i]!=A[j]||B[i]!=B[j]);
	long l=0,r=1e9;
	while(r-l>1)
	{
		long mid=(l+r)/2;
		if(f(j,mid)<f(i,mid))r=mid;
		else l=mid;
	}
	return r;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	cin>>N>>M;
	for(int i=0;i<N;i++)cin>>A[i]>>B[i];
	cin>>Q>>X;
	for(int i=0;i<N;i++)cin>>C[i];
	vector<int>P;
	P.push_back(0);
	for(int i=1;i<N;i++)
	{
		if(A[i-1]==A[i]&&B[i-1]==B[i])continue;
		while(P.size()>=2)
		{
			long a=g(P[P.size()-2],P[P.size()-1]);
			long b=g(P[P.size()-1],i);
			if(b<=a)P.pop_back();
			else break;
		}
		P.push_back(i);
	}
	int idx=0;
	for(int q=0;q<Q;q++)
	{
		assert(0<=idx&&idx<P.size());
		//cout<<X<<": ";for(int j=0;j<P.size();j++)cout<<f(P[j],X)<<", ";cout<<endl;
		long cur=f(P[idx],X);
		while(idx+1<N)
		{
			long tst=f(P[idx+1],X);
			if(cur>tst)cur=tst,idx++;
			else break;
		}
		cout<<P[idx]+1<<(q+1==Q?"\n":" ");
		X+=C[P[idx]];
	}
}