/**
 *   @FileName	a.cpp
 *   @Author	kanpurin
 *   @Created	2020.06.21 01:22:47
**/

#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

int main() {
    int n,q;cin >> n >> q;
    vector<pair<int,int>> a(n);
    for (int i = 0; i < n; i++) {
        cin >> a[i].first >> a[i].second;
    }
    sort(a.begin(), a.end());
    vector<pair<int,int>> query(q);
    for (int i = 0; i < q; i++) {
        cin >> query[i].first;
        query[i].second = i;
    }
    sort(query.begin(), query.end());
    vector<ll> sum1(n),sum2(n);
    int now = 0;
    ll weight = 0;
    for (int i = 0; i < q; i++) {
        if (i > 0) sum1[i] = sum1[i-1] + weight * (query[i].first - query[i-1].first);
        while(now < n && a[now].first <= query[i].first) {
            weight += a[now].second;
            sum1[i] += ll(query[i].first - a[now].first) * a[now].second;
            now++;
        }
    }
    weight = 0;
    now = n-1;
    for (int i = q-1; i >= 0; i--) {
        if (i + 1 < q) sum2[i] = sum2[i+1] + weight * (query[i+1].first - query[i].first);
        while(now >= 0 && a[now].first >= query[i].first) {
            weight += a[now].second;
            sum2[i] += ll(a[now].first - query[i].first) * a[now].second;
            now--;
        }
    }
    vector<ll> ans(q);
    for (int i = 0; i < q; i++) {
        ans[query[i].second] = sum1[i] + sum2[i];
    }
    for (int i = 0; i < q; i++) {
        cout << ans[i] << endl;
    }
    return 0;
}