#include<iostream>
#include<algorithm>
#include<vector>
#include<string>
#define rep(i, start, end) for (int i = (int)start; i < (int)end; ++i)
#define rrep(i, start, end) for (int i = (int)start - 1; i >= (int)end; --i)
#define all(x) (x).begin(), (x).end()
using namespace std;
using ll = long long;
template<typename T> inline bool chmax(T& a, T b) {if (a < b) {a = b; return true;} return 0;}
template<typename T> inline bool chmin(T& a, T b) {if (a > b) {a = b; return true;} return 0;}

struct query {
    int idx;
    ll X;
    query(int idx, ll X):idx(idx), X(X) {}
    bool operator<(const query& q) {
        return X < q.X;
    }
};

struct item {
    ll X, W;
    item(ll X, ll W):X(X), W(W) {}
    bool operator<(const item& i) {
        return X < i.X;
    }
};

int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, Q;
    cin >> N >> Q;
    vector<item> items;
    int x, w;
    rep(i, 0, N) {
        cin >> x >> w;
        items.emplace_back(x, w);
    }
    sort(all(items));
    vector<query> queries;
    rep(i, 0, Q) {
        cin >> x;
        queries.emplace_back(i, x);
    }
    sort(all(queries));
    vector<ll> lans(Q, 0);
    int idx = 0;
    ll prev_x = queries[0].X;
    ll left_sum = 0;
    rep(i, 0, Q) {
        lans[queries[i].idx] += left_sum * (queries[i].X - prev_x);
        if (i) {
            lans[queries[i].idx] += lans[queries[i - 1].idx];
        }
        while (idx < N && items[idx].X <= queries[i].X) {
            lans[queries[i].idx] += (queries[i].X - items[idx].X) * items[idx].W;
            left_sum += items[idx].W;
            ++idx;
        }
        prev_x = queries[i].X;
    }
    reverse(all(queries));
    reverse(all(items));
    vector<ll> rans(Q, 0);
    idx = 0;
    prev_x = queries[0].X;
    ll right_sum = 0;
    rep(i, 0, Q) {
        rans[queries[i].idx] += right_sum * (prev_x - queries[i].X);
        if (i) {
            rans[queries[i].idx] += rans[queries[i - 1].idx];
        }
        while (idx < N && items[idx].X >= queries[i].X) {
            rans[queries[i].idx] += (items[idx].X - queries[i].X) * items[idx].W;
            right_sum += items[idx].W;
            ++idx;
        }
        prev_x = queries[i].X;
    }
    rep(i, 0, Q) {
        cout << lans[i] + rans[i] << endl;
    }
    return 0;
}