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; }

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)); }


// floor(a / b)
Int divFloor(Int)(Int a, Int b) {
  return a / b - (((a ^ b) < 0 && a % b != 0) ? 1 : 0);
}

// ceil(a / b)
Int divCeil(Int)(Int a, Int b) {
  return a / b + (((a ^ b) > 0 && a % b != 0) ? 1 : 0);
}


void main() {
  try {
    for (; ; ) {
      const N = readInt;
      const Q = readInt;
      auto L = new int[N];
      auto R = new int[N];
      auto X = new int[N];
      auto Y = new int[N];
      foreach (i; 0 .. N) {
        L[i] = readInt;
        R[i] = readInt;
        X[i] = readInt;
        Y[i] = readInt;
      }
      auto A = new int[Q];
      foreach (q; 0 .. Q) {
        A[q] = readInt;
      }
      
      const limA = A.maxElement + 1;
      const thr = cast(int)(sqrt(cast(real)(N)));
      auto small = new int[][](thr, limA);
      auto big = new int[limA];
      foreach (i; 0 .. N) {
        const m = X[i];
        const l = m * divCeil(L[i] - Y[i], m) + Y[i];
        const r = m * divFloor(R[i] - Y[i], m) + Y[i];
        debug {
          writeln([m, l, r]);
        }
        if (l <= r) {
          if (m < thr) {
            if (l < limA) ++small[m][l];
            if (r + m < limA) --small[m][r + m];
          } else {
            for (int x = l; x <= r; x += m) {
              ++big[x];
            }
          }
        }
      }
      foreach (m; 1 .. thr) {
        foreach (x; m .. limA) {
          small[m][x] += small[m][x - m];
        }
      }
      
      foreach (q; 0 .. Q) {
        int ans;
        foreach (m; 1 .. thr) {
          ans += small[m][A[q]];
        }
        ans += big[A[q]];
        writeln(ans);
      }
    }
  } catch (EOFException e) {
  }
}