#include <iostream>
#include <vector>
#include <algorithm>
#include <array>
#include <iterator>
#include <string>
#include <cctype>
#include <cstring>
#include <cstdlib>
#include <cassert>
#include <cmath>
#include <ctime>
#include <iomanip>
#include <numeric>
#include <stack>
#include <queue>
#include <map>
#include <unordered_map>
#include <set>
#include <unordered_set>
#include <bitset>
#include <random>
#include <utility>
#include <functional>
using namespace std;
void Main()
{
	int N,M;
	cin >> N >> M;
	vector<int> A(N),B(N);
	for(int i = 0;i < N;i++)
	{
		cin >> A[i] >> B[i];
	}
	int Q;
	long long X;
	cin >> Q >> X;
	vector<int> C(N);
	for(int i = 0;i < N;i++)
	{
		cin >> C[i];
	}
	auto f = [&](long long x,int id) -> pair<long long,int>
	{
		long long ans = 0;
		int a = A[id],b = B[id];
		long long y = x - a;
		if(y < 0)
		{
			ans = (long long) M * (2 * a + (M - 1) * b) / 2 - x * M;
		}
		else if(y >= (M - 1) * b)
		{
			ans = -(long long) M * (2 * a + (M - 1) * b) / 2 + x * M;
		}
		else
		{
			//i * b <= x < (i + 1) * b
			//0 <= i < M - 1
			int j = y / b;
			ans += (long long) (j + 1) * (x - a) + (long long)(M - j - 1) * (a - x);
			ans += (long long) b * ((long long)M * (M - 1) / 2 - (long long)j * (j + 1) / 2);
			ans -= (long long) b * ((long long)j * (j + 1) / 2);
		}
		return make_pair(ans,id);
	};
	for(;Q--;)
	{
		int L = 0,R = N - 1;
		while(R - L > 2)
		{
			int mL = (L + L + R) / 3;
			int mR = (L + R + R) / 3;
			if(f(X,mL) < f(X,mR))
			{
				R = mR;
			}
			else
			{
				L = mL;
			}
		}
		pair<long long,int> a = f(X,L),b = f(X,L + 1),c = f(X,L + 2);
		if(a > b)
		{
			swap(a,b);
		}
		if(a > c)
		{
			swap(a,c);
		}
		cout << a.second + 1 << (Q ? " ":"\n");
		X += C[a.second];
	}
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) Main();
}