#include <bits/stdc++.h>
#define FOR(i, a, n) for(ll i = (ll)a; i < (ll)n; i++)
#define FORR(i, n) for(ll i = (ll)n - 1LL; i >= 0LL; i--)
#define rep(i, n) FOR(i, 0, n)
#define ALL(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template <typename T> using V = vector<T>;

constexpr int Mod = 998244353;
constexpr int mod = 1e9 + 7;
constexpr ll inf = 1LL << 60;

template <typename T> constexpr bool chmax(T &a, const T &b) {
    if(a >= b) return false;
    a = b;
    return true;
}
template <typename T> constexpr bool chmin(T &a, const T &b) {
    if(a <= b) return false;
    a = b;
    return true;
}

/*-------------------------------------------*/

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

    ll n, q;
    cin >> n >> q;
    using P = array<ll, 2>;
    V<P> w(n);
    rep(i, n) cin >> w[i][0] >> w[i][1];
    sort(ALL(w));
    V<int> p(q), ans(q);
    V<ll> x(q);
    rep(i, q) {
        cin >> x[i];
        p[i] = i;
    }
    sort(ALL(p), [&](int a, int b) { return x[a] < x[b]; });
    ll idx = 0;
    ll l = 0, r = 0;
    rep(i, n) {
        ans[p[0]] += abs(w[i][0] - x[p[0]]) * w[i][1];
        if(w[idx][0] < x[p[0]]) idx++;
        (w[i][0] < x[p[0]] ? l : r) += w[i][1];
    }
    ll sum = ans[p[0]];
    FOR(i, 1, q) {
        int j = p[i];
        ll s = 0;
        while(idx < n && w[idx][0] < x[j]) {
            r -= w[idx][1];
            s += w[idx][1];
            sum -= abs(w[idx][0] - x[p[i - 1]]) * w[idx][1];
            sum += abs(w[idx][0] - x[j]) * w[idx][1];
            idx++;
        }
        sum += (l - r) * (x[j] - x[p[i - 1]]);
        l += s;
        ans[j] = sum;
    }
    for(int a : ans)
        cout << a << endl;

    return 0;
}