#include <bits/stdc++.h>

using namespace std;

using ll = long long;
using P = pair<ll, ll>;

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin >> n >> q;

    vector<ll> x(n), w(n);
    vector<P> v;
    for (int i = 0; i < n; ++i) {
        cin >> x[i] >> w[i];
        v.emplace_back(x[i], i);
    }

    vector<ll> X(q);
    for (int i = 0; i < q; ++i) {
        cin >> X[i];
        v.emplace_back(X[i], i + n);
    }

    sort(v.begin(), v.end());

    vector<ll> ans(q, 0);
    ll sum = 0, ws = 0, px = 0;
    for (P& p : v) {
        if (p.second >= n) {
            if (px > 0) sum += (p.first - px) * ws;
            px = p.first;
            ans[p.second - n] += sum;
        } else {
            if (px > 0) sum += (p.first - px) * ws;
            ws += w[p.second];
            px = p.first;
        }
    }

    sum = 0, ws = 0, px = 0;
    reverse(v.begin(), v.end());
    for (P& p : v) {
        if (p.second >= n) {
            if (px > 0) sum += (px - p.first) * ws;
            px = p.first;
            ans[p.second - n] += sum;
        } else {
            if (px > 0) sum += (px - p.first) * ws;
            ws += w[p.second];
            px = p.first;
        }
    }

    for (int i = 0; i < q; ++i) {
        cout << ans[i] << "\n";
    }
    return 0;
}