#include<iostream>
#include<set>
#include<algorithm>
#include<vector>
#include<string>
#include<set>
#include<map>
#include<numeric>
#include<queue>
#include<cmath>
using namespace std;
typedef long long ll;
const ll INF=1LL<<60;
typedef pair<int,int> P;
typedef pair<int,P> PP;
const ll MOD=1e9+7;


int main(){
    int N,M;
    cin>>N>>M;
    vector<int> L(N),R(N),X(N),Y(N);
    ll maxR=0;
    for(int i=0;i<N;i++){
        cin>>L[i]>>R[i]>>X[i]>>Y[i];
        maxR=max(1LL*R[i],maxR);
    }

    ll K=maxR+1;


    vector<int> A(M);
    for(int i=0;i<M;i++)cin>>A[i];

    const ll T=max(1LL,(ll)sqrt(N));

    const ll MAXA=100000+10;
    vector<int> cnt(MAXA+1);

    vector<vector<ll>> imos(T,vector<ll>(MAXA+1,0));


     for(int i=0;i<N;i++){
        int l=L[i];
        int r=R[i];
        int x=X[i];
        int y=Y[i];

        if(x>=T){
            ll left=1LL*(L[i]-Y[i]+x-1)/x*x;

            for(ll t=left+y;t<=R[i];t+=X[i]){
                cnt[t]++;
            }
        }else{
            //x<T
            ll left=max(0LL,1LL*(l-y+x-1)/x*x + y);
            ll right=min(MAXA+1,1LL*(r-y)/x*x + y);
            if(l<=left && right<=r){

                imos[x][left]++;
                if(right+x<=MAXA){
                    imos[x][right+x]--;
                }
            }           
        }
    }

    for(int x=0;x<T;x++){
        for(int v=1;v<=MAXA;v++){
            if(v-x>=0){
                imos[x][v]+=imos[x][v-x];
            }
        }
    }

    vector<ll> num(MAXA+1,0);
    for(int x=0;x<T;x++){
        for(int v=1;v<=MAXA;v++){
            num[v]+=imos[x][v];
        }
    }


    vector<ll> ans(M);
    for(int i=0;i<M;i++){
        ans[i]=cnt[A[i]]+num[A[i]];
    }

    for(int v:ans){
        cout<<v<<endl;
    }

}