#include <vector>
#include <algorithm>
#include <iostream>
using namespace std;
pair<long long, long long> x[200000];
long long L[200000], Lsum[200000], R[200000], Rsum[200000];

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

    int N, Q; cin >> N >> Q;
    for(int i=1; i<=N; ++i) cin >> x[i].first >> x[i].second;
    sort(x + 1, x + N + 1);

    for(int i=1; i<=N; ++i) Lsum[i] = Lsum[i - 1] + x[i].second;
    for(int i=2; i<=N; ++i) L[i] = L[i - 1] + Lsum[i - 1] * (x[i].first - x[i - 1].first);

    for(int i=N; i>=1; --i) Rsum[i] = Rsum[i + 1] + x[i].second;
    for(int i=N-1; i>=1; --i) R[i] = R[i + 1] + Rsum[i + 1] * (x[i + 1].first - x[i].first);

    while(Q--) {
        long long X; cin >> X;
        int k = upper_bound(x + 1, x + N + 1, pair<long long, long long>(X, 0)) - begin(x);
        if(k == 1) {
            cout << R[1] + Rsum[1] * (x[1].first - X) << '\n';
        } else if(k == N + 1) {
            cout << L[N] + Lsum[N] * (X - x[N].first) << '\n';
        } else {
            cout << L[k - 1] + Lsum[k - 1] * (X - x[k - 1].first) + R[k] + Rsum[k] * (x[k].first - X) << '\n';
        }
    }
}