#include #include using namespace std; using namespace atcoder; #ifdef DEBUG #include "debug/all.hpp" #else #define debug(...) 42 #endif using ll = long long; using ull = unsigned long long; using ld = long double; using P = pair; using tp = tuple; template using vec = vector; template using vvec = vector>; #define all(hoge) (hoge).begin(), (hoge).end() #define en '\n' #define rep(i, m, n) for(ll i = (ll)(m); i < (ll)(n); ++i) #define rep2(i, m, n) for(ll i = (ll)(n)-1; i >= (ll)(m); --i) #define REP(i, n) rep(i, 0, n) #define REP2(i, n) rep2(i, 0, n) constexpr long long INF = 1LL << 60; constexpr int INF_INT = 1 << 30; // constexpr long long MOD = (ll)1e9 + 7; constexpr long long MOD = 998244353LL; static const ld pi = 3.141592653589793L; template inline bool chmin(T &a, T b) { if(a > b) { a = b; return true; } return false; } template inline bool chmax(T &a, T b) { if(a < b) { a = b; return true; } return false; } struct Edge { int to, rev; ll cap; Edge(int _to, int _rev, ll _cap) : to(_to), rev(_rev), cap(_cap) {} }; typedef vector Edges; typedef vector Graph; void add_edge(Graph &G, int from, int to, ll cap, bool revFlag, ll revCap) { G[from].push_back(Edge(to, (int)G[to].size(), cap)); if(revFlag) G[to].push_back(Edge(from, (int)G[from].size() - 1, revCap)); } void solve() { ll n, m; cin >> n >> m; map> mp; REP(i, n) { ll l, r, x, y; cin >> l >> r >> x >> y; mp[{x, y}].push_back({l, r}); } ll mm = 101010; vec con(mm, 0); for(auto [xy, lr] : mp) { auto [x, y] = xy; for(int i = y; i < mm; i += x) { for(auto [l, r] : lr) { if(l <= i and i <= r) con[i]++; } } } REP(i, m) { ll a; cin >> a; cout << con[a] << en; } } int main() { ios::sync_with_stdio(false); cin.tie(0); cout.tie(0); // cout << fixed << setprecision(10); // ll t; // cin >> t; // REP(i, t - 1) { // solve(); // } solve(); return 0; }