#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr long long LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
// constexpr int MOD = 1000000007;
constexpr int DY4[]{1, 0, -1, 0}, DX4[]{0, -1, 0, 1};
constexpr int DY8[]{1, 1, 0, -1, -1, -1, 0, 1};
constexpr int DX8[]{0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U>
inline bool chmax(T& a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U>
inline bool chmin(T& a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    std::cin.tie(nullptr);
    std::ios_base::sync_with_stdio(false);
    std::cout << fixed << setprecision(20);
  }
} iosetup;

ll aripro(const int a, const int d, const int n) {
  return n * (a * 2 + (n - 1LL) * d) / 2;
}

ll d(const int a, const int b, const int m, const ll r) {
  if (a > r) return aripro(a, b, m) - r * m;
  int lb = 0, ub = m;
  while (ub - lb > 1) {
    const int mid = midpoint(lb, ub);
    (a + ll{b} * mid <= r ? lb : ub) = mid;
  }
  return r * (lb + 1) - aripro(a, b, lb + 1) + aripro(a + b * (lb + 1LL), b, m - (lb + 1)) - r * (m - (lb + 1));
}

int main() {
  int n, m; cin >> n >> m;
  vector<int> a(n), b(n); REP(i, n) cin >> a[i] >> b[i];
  int q; ll x; cin >> q >> x;
  vector<int> c(n);
  for (int& c_i : c) cin >> c_i;
  int i = 0;
  REP(tm, q) {
    while (i + 1 < n && d(a[i], b[i], m, x) > d(a[i + 1], b[i + 1], m, x)) ++i;
    ll diff = LINF;
    int ans = -1;
    FOR(j, max(i - 10, 0), min(i + 11, n)) {
      if (chmin(diff, d(a[j], b[j], m, x))) ans = j;
    }
    cout << ans + 1 << " \n"[tm + 1 == q];
    x += c[ans];
  }
  return 0;
}