#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<bitset>
#include<set>
#include<map>
#include<stack>
#include<queue>
#include<deque>
#include<list>
#include<iomanip>
#include<cmath>
#include<cstring>
#include<functional>
#include<cstdio>
#include<cstdlib>
using namespace std;
 
#define repr(i, a, b) for (int i = (int)(a); i < (int)(b); i++)
#define rep(i, n) repr(i, 0, n)
#define INF 2e9
#define MOD 1000000007
//#define MOD 998244353
#define LINF (long long)4e18
#define jck 3.141592
 
const double EPS = 1e-10;
 
using ll = long long;
using Pi = pair<int,int>;
using Pl = pair<ll,ll>;


int main(){
    int N,Q; cin >> N >> Q;
    vector<Pl> xw(N);
    rep(i,N){
        cin >> xw[i].first >> xw[i].second;
    }
    sort(xw.begin(),xw.end());
    vector<ll> sumw(N+1);
    rep(i,N){
        sumw[i+1] = sumw[i]+xw[i].second;
    }
    vector<ll> sumxw(N+1);
    rep(i,N){
        sumxw[i+1] = sumxw[i]+xw[i].first*xw[i].second;
    }
    rep(i,Q){
        ll x; cin >> x;
        int p = lower_bound(xw.begin(),xw.end(),Pl(x,0LL))-xw.begin();
        ll ans = x*sumw[p]-sumxw[p]+sumxw[N]-sumxw[p]-x*sumw[N]+x*sumw[p];
        cout << ans << endl;
    }

}