#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int(i) = 0; (i) < (n); (i)++)
#define FOR(i, m, n) for(int(i) = (m); (i) < (n); (i)++)
#define All(v) (v).begin(), (v).end()
#define pb push_back
#define MP(a, b) make_pair((a), (b))
template <class T> vector<T> make_vec(size_t a, T val) {
    return vector<T>(a, val);
}
template <class... Ts> auto make_vec(size_t a, Ts... ts) {
    return vector<decltype(make_vec(ts...))>(a, make_vec(ts...));
}
using ll = long long;
using pii = pair<int, int>;
using pll = pair<ll, ll>;
using Graph = vector<vector<int>>;
template <typename T> struct edge {
    int to;
    T cost;
    edge(int t, T c) : to(t), cost(c) {}
};
template <typename T> using WGraph = vector<vector<edge<T>>>;
const int INF = 1 << 30;
const ll LINF = 1LL << 60;
const int MOD = 1e9 + 7;

int main() {
    int N, Q;
    cin >> N >> Q;
    vector<pll> bag(N);
    rep(i, N) cin >> bag[i].first >> bag[i].second;
    vector<pll> query(Q);
    rep(i, Q) {
        int q;
        cin >> q;
        query[i] = {q, i};
    }
    sort(All(bag));
    sort(All(query));
    vector<ll> res(Q);
    ll ans = 0;
    int cur = 0;
    ll sum = 0;
    ll all = 0;
    for(int i = 0; i < N; i++) {
        auto [x, w] = bag[i];
        ans += abs(query[0].first - x) * w;
        if(x < query[0].first) {
            cur++;
            sum += w;
        }
        all += w;
    }
    res[query[0].second] = ans;

    for(int i = 1; i < Q; i++) {
        auto [dst, id] = query[i];
        ans += sum * (dst - query[i - 1].first);
        while(cur < N && bag[cur].first < dst) {
            auto [x, w] = bag[cur];
            ans -= abs(query[i - 1].first - x) * w;
            ans += abs(dst - x) * w;
            sum += w;
            cur++;
        }
        ll rest = all - sum;
        ans -= rest * (dst - query[i - 1].first);
        res[id] = ans;
    }
    rep(i, Q) { cout << res[i] << endl; }
}