//#define _GLIBCXX_DEBUG
#include <bits/stdc++.h>
#define rep(i, n) for(int i=0; i<n; ++i)
#define all(v) v.begin(), v.end()
#define rall(v) v.rbegin(), v.rend()
using namespace std;
using ll = int64_t;
using ld = long double;
using P = pair<int, int>;
using vs = vector<string>;
using vi = vector<int>;
using vvi = vector<vi>;
template<class T> using PQ = priority_queue<T>;
template<class T> using PQG = priority_queue<T, vector<T>, greater<T> >;
const int INF = 100010001;
const ll LINF = (ll)INF*INF*10;
template<typename T1, typename T2>
inline bool chmax(T1 &a, T2 b) {return a < b && (a = b, true);}
template<typename T1, typename T2>
inline bool chmin(T1 &a, T2 b) {return a > b && (a = b, true);}
template<typename T1, typename T2>
istream &operator>>(istream &is, pair<T1, T2> &p) { return is >> p.first >> p.second;}
template<typename T1, typename T2>
ostream &operator<<(ostream &os, const pair<T1, T2> &p) { return os << p.first << ' ' << p.second;}

const int N =1e5+10;

//head

int n, q;
P x[N]; //x, w
ll sum1[N], sum2[N];


int main() {
  ios::sync_with_stdio(false);
  cin.tie(0);
  
  cin >> n >> q;
  rep(i, n) cin >> x[i];

  sort(x, x+n);

  rep(i, n) {
    sum1[i+1] = sum1[i] + x[i].second;
    sum2[i+1] = sum2[i] + ll(x[i].first)*x[i].second;
  }

  while(q--) {
    ll X;
    cin >> X;

    int num = lower_bound(x, x+n, P(X, 0)) - x;
    ll res = 0;
    res += sum1[num] * X;
    res -= sum2[num];
    res -= (sum1[n] - sum1[num]) * X;
    res += sum2[n] - sum2[num];

    cout << res << '\n';
  }
}