#include <iostream>
#include <string>
#include <vector>
#include <queue>
#include <deque>
#include <algorithm>
#include <set>
#include <map>
#include <bitset>
#include <cmath>
#include <functional>
#include <iomanip>
#define vll vector<ll>
#define vvvl vector<vvl>
#define vvl vector<vector<ll>>
#define VV(a, b, c, d) vector<vector<d>>(a, vector<d>(b, c))
#define VVV(a, b, c, d) vector<vvl>(a, vvl(b, vll (c, d)));
#define re(c, b) for(ll c=0;c<b;c++)
#define all(obj) (obj).begin(), (obj).end()
typedef long long int ll;
typedef long double ld;
using namespace std;

int main(int argc, char const *argv[]) {
  ll n, q;std::cin >> n >> q;
  vvl d = VV(n, 2, 0, ll);
  re(i, n) scanf("%lld %lld", &d[i][0],&d[i][1]);
  sort(all(d));
  vvl Q = VV(q, 2, 0, ll);
  for(int i=0;i<q;i++) {
    scanf("%lld", &Q[i][0]);
    Q[i][1] = i;
  }
  sort(all(Q));
  ll idx = 0;
  vll ans(q, 0);
  ll wsum = 0;
  ll S = 0;

  for(int i=0;i<q;i++){
    if(i!=0) S += (Q[i][0] - Q[i-1][0]) * wsum;
    ll x = Q[i][0], y = Q[i][1];
    while(idx!=n&&d[idx][0]<=x){
      S += (x-d[idx][0])*d[idx][1];
      wsum += d[idx][1];
      idx++;
    }
    ans[y] += S;
  }

  wsum = S = 0;
  idx = n-1;
  for(int i=q-1;i>=0;i--){
    if(i!=q-1) S += (Q[i+1][0] - Q[i][0]) * wsum;
    ll x = Q[i][0], y = Q[i][1];
    while(idx!=-1&&d[idx][0]>=x){
      S += (d[idx][0] - x) * d[idx][1];
      wsum += d[idx][1];
      idx--;
    }
    ans[y] += S;
  }
  for(int i=0;i<q;i++) std::cout << ans[i] << '\n';
  return 0;
}