#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};


int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, Q;
    cin >> N >> Q;
    vector<pair<ll,ll>> v(N);
    REP(i,N){
        cin >> v[i].first >> v[i].second;
    }
    sort(v.begin(), v.end());
    vector<ll> sumX(N+1), sumW(N+1);
    REP(i,N) sumX[i+1] = sumX[i] + v[i].first * v[i].second, sumW[i+1] = sumW[i] + v[i].second;
    REP(i,Q){
        ll X;
        cin >> X;
        int idx = lower_bound(v.begin(), v.end(), make_pair(X,0LL)) - v.begin();
        //cout << idx << endl;
        ll ans = (X * sumW[idx] - sumX[idx]);
        //cout << ans << " ";
        ans += (sumX[N] - sumX[idx]) - X * (sumW[N] - sumW[idx]);
        cout << ans << endl;
    }

}