#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef long double ld;
#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = m; i >= n; --i)
#define ALL(v) (v).begin(),(v).end()
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
const ll INF=1LL<<60;
const int inf=(1<<30)-1;
const int mod=1e9+7;
int dx[8]={1,0,-1,0,-1,-1,1,1};
int dy[8]={0,1,0,-1,-1,1,-1,1};
int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    ll n,q;cin >> n >> q;
    vector<ll> x(n),w(n);
    vector<pair<ll,ll>> p(n);
    REP(i,n){
        cin >> x[i] >> w[i];
        p[i]={x[i],w[i]};
    }
    sort(ALL(p));
    vector<ll> sx(n+1),sw(n+1);
    REP(i,n){
        x[i]=p[i].first;
        w[i]=p[i].second;
        sw[i+1]=sw[i]+w[i];
        sx[i+1]=sx[i]+x[i]*w[i];
    }
    while(q--){
        ll k;cin >> k;
        int u=lower_bound(ALL(x),k)-x.begin();
        cout << -k*sw[n]+2*k*sw[u]+sx[n]-2*sx[u] << endl;
    }
}