#include <iostream>
#include <vector>
#include <algorithm>
using namespace std;
using ll = long long;
using P = pair<ll, ll>;

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);

    int N, Q; cin >> N >> Q;
    vector<P> xw(N);
    for (int i = 0; i < N; i++) {
        ll x, w; cin >> x >> w;
        xw[i] = P(x, w);
    }
    sort(xw.begin(), xw.end());
    
    vector<ll> csXW(N+1), csW(N+1);
    for (int i = 0; i < N; i++) {
        csXW[i+1] = csXW[i] + xw[i].first * xw[i].second;
        csW[i+1] = csW[i] + xw[i].second;
    }

    for (int i = 0; i < Q; i++) {
        ll X; cin >> X;
        int k = lower_bound(xw.begin(), xw.end(), P(X, 0)) - xw.begin();
        ll ans = 0;
        ans += csXW.back() - 2 * csXW[k];
        ans += 2 * X * csW[k] - X * csW.back();
        cout << ans << "\n";
    }
}