#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
//const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, m; cin >> n >> m;
	int thr = sqrt(100005);
	vector<int>ans(100005);
	vector memo(thr, vector<int>(100005));
	rep(i, n) {
		int l, r, x, y; cin >> l >> r >> x >> y;
		l = ((l - y + x - 1) / x)*x + y;
		r = ((r - y + x) / x)*x + y;
		//cout << l << " " << r << endl;
		if (x < thr) {
			memo[x][l]++;
			if (r < 100005)memo[x][r]--;
		}
		else {
			while (l < r) {
				ans[l]++;
				l += x;
			}
		}
	}
	rep2(i, 1, thr) {
		rep2(j, i, 100005)memo[i][j] += memo[i][j - i];
		rep(j, 100005)ans[j] += memo[i][j];
	}
	rep(i, m) {
		int x; cin >> x;
		cout << ans[x] << endl;
	}
	return 0;
}