#include <bits/stdc++.h>
using namespace std;
typedef long long ll;

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N,Q; cin >> N >> Q;
    vector<ll> x(N),w(N);
    for (int i=0;i<N;++i) cin >> x[i] >> w[i];
    vector<ll> X(Q);
    for (int i=0;i<Q;++i) cin >> X[i];
    vector<pair<ll,ll>> pos;
    for (int i=0;i<N;++i) pos.emplace_back(x[i],w[i]);
    for (int i=0;i<Q;++i) pos.emplace_back(X[i],-i);
    sort(pos.begin(),pos.end());
    ll now=0,last=0,cnt=0,sum=0;
    for (int i=0;i<N;++i) now+=x[i]*w[i],sum+=w[i];
    vector<ll> ans(Q);
    for (auto p:pos){
        int y=p.first,id=p.second;
        now+=cnt*(y-last);
        now-=(sum-cnt)*(y-last);
        if (id>0) cnt+=id;
        else ans[-id]=now;
        last=y;
    }
    for (int i=0;i<Q;++i) cout << ans[i] << '\n';
}