#include <iostream>
#include <algorithm>
#include <string>
#include <vector>
#include <cmath>
#include <map>
#include <queue>
#include <iomanip>
#include <set>
#include <tuple>
#define mkp make_pair
#define mkt make_tuple
#define rep(i,n) for(int i = 0; i < (n); ++i)
using namespace std;
typedef long long ll;
const ll MOD=1e9+7;
template<class T> void chmin(T &a,const T &b){if(a>b) a=b;}
template<class T> void chmax(T &a,const T &b){if(a<b) a=b;}

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

  int N,Q;
  cin>>N>>Q;
  vector<ll> X(N),W(N);
  rep(i,N) cin>>X[i]>>W[i];
  vector<ll> Y(Q);
  rep(i,Q) cin>>Y[i];

  vector<int> ord(N);
  rep(i,N) ord[i]=i;
  sort(ord.begin(),ord.end(),[&](int a,int b){
    return X[a]<X[b];
  });

  vector<int> query(Q);
  rep(i,Q) query[i]=i;
  sort(query.begin(),query.end(),[&](int a,int b){
    return Y[a]<Y[b];
  });


  vector<ll> ans(Q,0);
  ll weg=0;
  int now=0;
  ll sum=0;
  for(int i=0;i<Q;i++){
    int q=query[i];
    ll res=0;
    if(i>0) res=(Y[q]-Y[query[i-1]])*weg;
    while(now<N&&X[ord[now]]<=Y[q]){
      int tar=ord[now];
      res+=(Y[q]-X[tar])*W[tar];
      weg+=W[tar];
      now++;
    }
    ans[q]+=sum+res;
    sum+=res;
  }

  weg=0;
  now=N-1;
  sum=0;
  for(int i=Q-1;i>=0;i--){
    int q=query[i];
    ll res=0;
    if(i<Q-1) res=(Y[query[i+1]]-Y[q])*weg;
    while(now>=0&&X[ord[now]]>=Y[q]){
      int tar=ord[now];
      res+=(X[tar]-Y[q])*W[tar];
      weg+=W[tar];
      now--;
    }
    ans[q]+=sum+res;
    sum+=res;
  }

  rep(i,Q) cout<<ans[i]<<"\n";

  return 0;
}