#include<bits/stdc++.h>
#include<atcoder/all>
using namespace std;
using namespace atcoder;

typedef modint998244353 mint;
typedef long long ll;

int main(){
	// if X[i] <= 100, then do for anytime.
	
	const int BORDER = 250;
	const int MX = 100005;

	int n, m; cin >> n >> m;
	vector<int> ans(m);
	vector<int> bucket(MX);
	vector<vector<int>> imos(BORDER, vector<int>(MX, 0));
	for (int i=0; i<n; i++){
		int l, r, x, y; cin >> l >> r >> x >> y;
		r++;
		int v = ((l - y + x - 1) / x) * x + y;
		assert (l <= v);
		if (x >= BORDER){
			while (v < r){
				if (l <= v) bucket[v]++;
				v += x;
			}
		}else{
			if (v < r){
				imos[x][v]++;
				imos[x][v + ((r - v + x - 1) / x) * x]--;
			}
		}
	}
	for (int i=1; i<BORDER; i++){
		for (int j=0; j<MX-i; j++){
			imos[i][j+i] += imos[i][j];
		}
	}
	vector<int> a(m);
	for (int i=0; i<m; i++){
		cin >> a[i];
		ans[i] += bucket[a[i]];
		for (int j=0; j<BORDER; j++){
			ans[i] += imos[j][a[i]];
		}
	}
	for (int i=0; i<m; i++){
		cout << ans[i] << "\n";
	}

}