#include<bits/stdc++.h>
using namespace std;
//#pragma GCC optimize("Ofast")

#define rep(i,n) for(ll i=0;i<n;i++)
#define repl(i,l,r) for(ll i=(l);i<(r);i++)
#define per(i,n) for(ll i=(n)-1;i>=0;i--)
#define perl(i,r,l) for(ll i=r-1;i>=l;i--)
#define fi first
#define se second
#define pb push_back
#define ins insert
#define pqueue(x) priority_queue<x,vector<x>,greater<x>>
#define all(x) (x).begin(),(x).end()
#define CST(x) cout<<fixed<<setprecision(x)
#define vtpl(x,y,z) vector<tuple<x,y,z>>
#define rev(x) reverse(x);
using ll=long long;
using vl=vector<ll>;
using vvl=vector<vector<ll>>;
using pl=pair<ll,ll>;
using vpl=vector<pl>;
using vvpl=vector<vpl>;
const ll MOD=1000000007;
const ll MOD9=998244353;
const int inf=1e9+10;
const ll INF=4e18;
const ll dy[9]={1,0,-1,0,1,1,-1,-1,0};
const ll dx[9]={0,1,0,-1,1,-1,1,-1,0};
template<class T> inline bool chmin(T& a, T b) {
    if (a >= b) {
        a = b;
        return true;
    }
    return false;
}
template<class T> inline bool chmax(T& a, T b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

int main(){
    ll n,m;cin >> n >> m;
    ll base=100;
    vector<map<ll,pair<vl,vl>>> small(base);
    ll sz=1e5+10;
    vl dp(sz);
    pair<vl,vl> que;

    rep(_,n){
        ll l,r,x,y;cin >> l >> r >> x >> y;
        if(x<base){
            if(!small[x].count(y)){
                small[x][y]=que;
            }
            small[x][y].first.push_back(l);
            small[x][y].second.push_back(r);
        }
        else {
            for(ll k=y;k<sz;k+=x){
                if(k>=l&&k<=r)dp[k]++;
            }
        }
    }
    for(auto &p:small){
        for(auto &[hoge,vs]:p){
            sort(all(vs.first));
            sort(all(vs.second));
        }
    }
    //return 0;
    rep(_,m){
        ll a;cin >> a;
        ll ans=dp[a];
        for(ll k=1;k<base;k++){
            if(small[k].count(a%k)){
                auto &[va,vb]=small[k][a%k];
                ans-=va.size();
                ans+=upper_bound(all(va),a)-va.begin();
                ll f=lower_bound(all(vb),a)-vb.begin();
                ans+=va.size()-f;
            }
        }
        cout << ans << endl;
    }
}