#include "bits/stdc++.h"

#define MOD 1000000007
#define rep(i, n) for(ll i=0; i < (n); i++)
#define rrep(i, n) for(ll i=(n)-1; i >=0; i--)
#define ALL(v) v.begin(),v.end()
#define rALL(v) v.rbegin(),v.rend()
#define FOR(i, j, k) for(ll i=j;i<k;i++)
#define debug_print(var) cerr << #var << "=" << var <<endl;
#define DUMP(i, v)for(ll i=0;i<v.size();i++)cerr<<v[i]<<" "
#define fi first
#define se second

using namespace std;
typedef long long int ll;
typedef vector<ll> llvec;
typedef vector<double> dvec;
typedef pair<ll, ll> P;
typedef long double ld;
struct edge{ll x, c;};

/**************************************
** A main function starts from here  **
***************************************/
int main(){
  ll N;
  cin >> N;
  ll Q;
  cin >> Q;
  vector<P> v(N);
  rep(i, N){
    cin >> v[i].fi >> v[i].se;
  }
  sort(ALL(v));
  llvec S(N+1, 0);
  llvec T(N+1, 0);
  rep(i, N){
    S[i+1] = S[i] +v[i].fi*v[i].se;
    T[i+1] = T[i] +v[i].se;
  }

  while(Q--){
    ll x;
    cin >> x;
    P f = {x, 0};
    ll m = lower_bound(ALL(v), f) - v.begin();
    ll ans =  T[m]*x- S[m] + (S[N]-S[m]) - (T[N]-T[m])*x;
    cout << ans << endl;
  }
  
  return 0;
}