#include <iostream>
#include <algorithm>
#include <iomanip>
#include <vector>
#include <queue>
#include <set>
#include <map>

using namespace std;
typedef long long ll;
typedef pair<ll, ll> P;
int N, Q;
ll x[100000], w[100000];
ll X[100000];
ll Y[100000];
int idx[100000];
P p[100000];
P q[100000];
ll sumW[100001];
ll sumWX[100001];

int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    cout << setprecision(10) << fixed;
    cin >> N >> Q;
    for(int i = 0; i < N; i++){
        cin >> x[i] >> w[i];
        p[i] = P(x[i], w[i]);
    }
    sort(p, p+N);
    for(int i = 0; i < N; i++){
        x[i] = p[i].first;
        w[i] = p[i].second;
        sumW[i+1] = sumW[i]+w[i];
        sumWX[i+1] = sumWX[i]+(w[i]*x[i]);
    }
    for(int i = 0; i < Q; i++){
        cin >> X[i];
        q[i] = P(X[i], i);
    }
    sort(q, q+N);
    for(int i = 0; i < Q; i++){
        Y[i] = q[i].first;
        idx[i] = q[i].second;
    }
    for(int i = 0; i < Q; i++){
        auto ptr = lower_bound(x, x+N, X[i]);
        int m = ptr-x;
        ll rXW = sumWX[N]-sumWX[m];
        ll lXW = sumWX[m]; 
        ll rW = sumW[N]-sumW[m];
        ll lW = sumW[m]; 
        ll ans = X[i]*(lW-rW)+rXW-lXW;
        // cout << m << ' ' << lW << ' ' << rW << ' ' << lXW << ' ' << rXW << endl;
        cout << ans << endl;
    }
}