#include<bits/stdc++.h>
namespace {
#pragma GCC diagnostic ignored "-Wunused-function"
#include<atcoder/all>
#pragma GCC diagnostic warning "-Wunused-function"
using namespace std;
using namespace atcoder;
#define rep(i,n) for(int i = 0; i < (int)(n); i++)
#define rrep(i,n) for(int i = (int)(n) - 1; i >= 0; i--)
#define all(x) begin(x), end(x)
#define rall(x) rbegin(x), rend(x)
template<class T> bool chmax(T& a, const T& b) { if (a < b) { a = b; return true; } else return false; }
template<class T> bool chmin(T& a, const T& b) { if (b < a) { a = b; return true; } else return false; }
using ll = long long;
using P = pair<int,int>;
using VI = vector<int>;
using VVI = vector<VI>;
using VL = vector<ll>;
using VVL = vector<VL>;

constexpr int B = 320;
constexpr int MX = 100010;

} int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  int n, m;
  cin >> n >> m;
  VI d(MX);
  vector<vector<tuple<int, int, int>>> lry(B);
  rep(_, n) {
    int l, r, x, y;
    cin >> l >> r >> x >> y;
    r++;
    if (x >= B) {
      // l <= y + kx < r
      // (l - y) / x <= k < (r - y) / x
      int klb = (l - y + x - 1) / x;
      int kub = (r - y + x - 1) / x;
      for(int k = klb; k < kub; k++) {
        d[y + k * x]++;
      }
    } else {
      lry[x].emplace_back(l, r, y);
    }
  }
  VI t(MX);
  rep(x, B) if (x) {
    t.assign(MX, 0);
    for(auto [l, r, y] : lry[x]) {
      int klb = (l - y + x - 1) / x;
      int kub = (r - y + x - 1) / x;
      if (klb == kub) continue;
      t[y + klb * x]++;
      if (y + kub * x < MX) t[y + kub * x]--;
    }
    rep(i, MX - x) t[i + x] += t[i];
    rep(i, MX) d[i] += t[i];
  }
  rep(_, m) {
    int a;
    cin >> a;
    cout << d[a] << '\n';
  }
}