#include<bits/stdc++.h>
#include<unistd.h>
#define REP(i,n) for(int i=0,i##_len=(n);i<i##_len;++i)
#define rep(i,a,b) for(int i=int(a);i<int(b);++i)
#define All(x) (x).begin(),(x).end()
using namespace std;
typedef long long ll;

vector<ll> gutyoku(ll N,ll Q,vector<pair<ll,ll>> A,vector<ll> X){
    vector<ll> res;
    REP(q,Q){
        ll tmp=0;
        REP(i,N) tmp+=abs(A[i].first-X[q])*A[i].second;
        res.push_back(tmp);
    }
    return res;
}

vector<ll> ans1(ll N,ll Q,vector<pair<ll,ll>> A,vector<ll> X){
    sort(All(A));
    vector<ll> x(N),w(N);
    REP(i,N){
        x[i]=A[i].first;
        w[i]=A[i].second;
    }
    vector<ll> cost(N,0),sw(N+1,0);
    REP(i,N){
        cost[0]+=(x[i]-x[0])*w[i];
        sw[i+1]=sw[i]+w[i];
    }
    REP(i,N-1){
        cost[i+1]=cost[i]+(x[i+1]-x[i])*(sw[i+1]-(sw[N]-sw[i+1]));
    }
    vector<ll> res;
    REP(q,Q){
        int k=lower_bound(All(x),X[q])-x.begin();
        if(k==0){
            res.push_back(cost[0]+(x[0]-X[q])*sw[N]);
        }
        else{
            res.push_back(cost[k-1]+(X[q]-x[k-1])*(sw[k]-(sw[N]-sw[k])));
        }
    }
    return res;
}

int main(){
    ll N,Q;cin>>N>>Q;
    vector<pair<ll,ll>> A(N);
    REP(i,N) cin>>A[i].first>>A[i].second;
    vector<ll> X(Q);
    REP(i,Q) cin>>X[i];

    vector<ll> ans=ans1(N,Q,A,X);
    REP(i,Q){
        cout<<ans[i]<<endl;
    }
}