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

    for (int i = 0; i < Q; i++) {
        int X; cin >> X;
        int left = 0, right = N+1;
        while (right - left > 1) {
            int mid = (left + right) / 2;
            if (xw[mid].first <= X)
                left = mid;
            else
                right = mid;
        }
        ll ans = 0;
        ans += csXW.back() - 2 * csXW[left];
        ans += 2 * X * csW[left] - X * csW.back();
        cout << ans << "\n";
    }
}