import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }

string COLOR(string s = "") { return "\x1b[" ~ s ~ "m"; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }




void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const M = readLong;
      auto A = new long[N];
      auto B = new long[N];
      foreach (i; 0 .. N) {
        A[i] = readLong;
        B[i] = readLong;
      }
      const Q = readInt;
      const X = readLong;
      auto C = new long[N];
      foreach (i; 0 .. N) {
        C[i] = readLong;
      }
      
      long at(int i, long k) {
        return A[i] + k * B[i];
      }
      long eval(int i, long x) {
        long m;
        if (x <= at(i, 0)) {
          m = 0;
        } else if (x >= at(i, M - 1)) {
          m = M;
        } else {
          m = (x - A[i]) / B[i] + 1;
        }
        long ret;
        ret += m * x;
        ret -= m * (at(i, 0) + at(i, m - 1)) / 2;
        ret += (M - m) * (at(i, m) + at(i, M - 1)) / 2;
        ret -= (M - m) * x;
        debug {
          writefln("eval %s %s = %s", i, x, ret);
        }
        return ret;
      }
      long meet(int i, int j) {
        long lo = at(i, 0) - 1;
        long hi = at(j, M - 1) + 1;
        for (; lo + 1 < hi; ) {
          const mid = (lo + hi) / 2;
          ((tuple(eval(i, mid), i) > tuple(eval(j, mid), j)) ? hi : lo) = mid;
        }
        debug {
          writefln("meet %s %s = %s", i, j, hi);
        }
        return hi;
      }
      
      int len;
      auto js = new int[N];
      auto xs = new long[N];
      foreach (i; 0 .. N) {
        if (i && A[i - 1] == A[i] && B[i - 1] == B[i]) {
          continue;
        }
        for (; len >= 1; --len) {
          const x = meet(js[len - 1], i);
          if (xs[len - 1] < x) {
            js[len] = i;
            xs[len] = x;
            ++len;
            goto added;
          }
        }
        js[len] = i;
        xs[len] = long.min;
        ++len;
       added:
      }
      js.length = len;
      xs.length = len;
      debug {
        writeln("js = ", js);
        writeln("xs = ", xs);
      }
      
      auto ans = new int[Q];
      long x = X;
      foreach (q; 0 .. Q) {
        const pos = xs.upperBound(x) - 1;
        ans[q] = js[pos];
        x += C[ans[q]];
      }
      
      foreach (q; 0 .. Q) {
        if (q) write(" ");
        write(ans[q] + 1);
      }
      writeln;
    }
  } catch (EOFException e) {
  }
}