// #define _GLIBCXX_DEBUG // for STL debug (optional)
#include <iostream>
#include <iomanip>
#include <cstdio>
#include <string>
#include <cstring>
#include <deque>
#include <list>
#include <queue>
#include <stack>
#include <vector>
#include <utility>
#include <algorithm>
#include <map>
#include <set>
#include <complex>
#include <cmath>
#include <limits>
#include <cfloat>
#include <climits>
#include <ctime>
#include <cassert>
#include <numeric>
#include <fstream>
#include <functional>
#include <bitset>
using namespace std;
using ll = long long int;
using int64 = long long int;
 
template<typename T> void chmax(T &a, T b) {a = max(a, b);}
template<typename T> void chmin(T &a, T b) {a = min(a, b);}
template<typename T> void chadd(T &a, T b) {a = a + b;}
 
int dx[] = {0, 0, 1, -1};
int dy[] = {1, -1, 0, 0};
const int INF = 1LL << 29;
const ll LONGINF = 1LL << 60;
const ll MOD = 1000000007LL;
 
int main() {
    int N, Q; scanf("%d%d", &N, &Q);
    vector< pair<ll, ll> > items;
    for(int i=0; i<N; i++) {
        ll x, w; scanf("%lld%lld", &x, &w);
        items.emplace_back(x, w);
    }

    vector<ll> rec(Q);
    for(int i=0; i<Q; i++) {
        ll x; scanf("%lld", &x); rec[i] = x;
        items.emplace_back(x, 0LL);
    }

    sort(items.begin(), items.end());
    N = items.size();
    vector<ll> L(N), R(N);
    {
        ll SL = 0, wsum = 0;
        for(int i=1; i<N; i++) {
            ll X1 = items[i].first;
            ll W, X0; tie(X0, W) = items[i-1];

            wsum += W;
            SL += wsum * (X1 - X0);
            L[i] = SL;
        }
    }
    {
        ll SR = 0, wsum = 0;
        for(int i=N-2; i>=0; i--) {
            ll W, X1; tie(X1, W) = items[i+1];
            ll X0 = items[i].first;

            wsum += W;
            SR += wsum * (X1 - X0);
            R[i] = SR;
        }
    }

    for(int i=0; i<Q; i++) {
        int k = lower_bound(items.begin(), items.end(), make_pair(rec[i], -1LL)) - items.begin();
        printf("%lld\n", L[k] + R[k]);
    }
    return 0;
}