#include <stdio.h>
#include <string>
#include <cstring>
#include <stdlib.h>
#include <math.h>
#include <algorithm>
#include <vector>
#include <set>
#include <map>
#include <queue>
#include <stack>
#include <list>
#include <iterator>
#include <assert.h>
#pragma warning(disable:4996) 
 
typedef long long ll;
#define MIN(a, b) ((a)>(b)? (b): (a))
#define MAX(a, b) ((a)<(b)? (b): (a))
#define LINF  9223300000000000000
#define LINF2 1223300000000000000
#define INF 2140000000
const long long MOD = 1000000007;
//const long long MOD = 998244353;

using namespace std;

void solve()
{
    int n, Q;
    scanf("%d%d", &n, &Q);
    vector<pair<int, int> > z(n);   // x,w
    int i;
    for (i = 0; i < n; i++) {
        scanf("%d%d", &z[i].first, &z[i].second);
    }
    sort(z.begin(), z.end());

    vector<ll> sw(n + 1), sxw(n + 1), xx(n);
    for (i = 0; i < n; i++) {
        int x = z[i].first;
        int w = z[i].second;
        sw[i + 1] = sw[i] + w;
        sxw[i + 1] = sxw[i] + (ll)w*x;
        xx[i] = x;
    }

    for (i = 0; i < Q; i++) {
        int x0;
        scanf("%d", &x0);
        int k = lower_bound(xx.begin(), xx.end(), x0) - xx.begin();
        ll ans0 = x0 * sw[k] - sxw[k];
        ll ans1 = -x0 * (sw[n] - sw[k]) + (sxw[n] - sxw[k]);
        ll ans = ans0 + ans1;
        printf("%lld\n", ans);
    }

    return;
}

int main(int argc, char* argv[])
{
#if 1
    solve();
#else
    int T; scanf("%d", &T);
    while(T--) {
        solve();
    }
#endif
    return 0;
}