#include <bits/stdc++.h>
using namespace std;
#define rep(i,n) REP(i,0,n)
#define REP(i,s,e) for(int i=(s); i<(int)(e); i++)
#define repr(i, n) REPR(i, n, 0)
#define REPR(i, s, e) for(int i=(int)(s-1); i>=(int)(e); i--)
#define pb push_back
#define all(r) r.begin(),r.end()
#define rall(r) r.rbegin(),r.rend()
#define fi first
#define se second

typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;

const ll INF = 1e18;
const ll MOD = 1e9 + 7;
const double EPS = 1e-8;

template<typename T> T chmax(T& a, const T& b){return a = (a > b ? a : b);}
template<typename T> T chmin(T& a, const T& b){return a = (a < b ? a : b);}

// #define DEBUG_MODE
#ifdef DEBUG_MODE
#define dump(x) cout << #x << " : " << x << " "
#define dumpL(x) cout << #x << " : " << x << '\n'
#define LINE cout << "line : " << __LINE__ << " "
#define LINEL cout << "line : " << __LINE__ << '\n'
#define dumpV(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << " "
#define dumpVL(v) cout << #v << " : ["; for(auto& t : v) cout << t << ", "; cout<<"]" << endl
#define STOP assert(false)
#else
#define dump(x) 
#define dumpL(x) 
#define LINE 
#define LINEL 
#define dumpV(v) 
#define dumpVL(v) 
#define STOP assert(false)
#endif
#define mp make_pair
 
namespace std {
template<class S, class T>
ostream &operator <<(ostream& out, const pair<S, T>& a) {
    out << '(' << a.fi << ", " << a.se << ')';
    return out;
}
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    int N, Q;
    cin >> N >> Q;
    vl x(N), w(N);
    {   
        vector<pll> p(N);
        rep(i, N) cin >> p[i].fi >> p[i].se;
        sort(all(p));
        rep(i, N) {
            x[i] = p[i].fi;
            w[i] = p[i].se;
        }
    }
    vl X(Q);
    rep(i, Q) cin >> X[i];
    // sort(all(X));

    map<ll, ll> mp;
    {
        rep(i, N) mp[x[i]] = 0;
        rep(i, Q) mp[X[i]] = 0;
        int cnt = 0;
        for(auto& p : mp) p.se = cnt++;
    }
    ll add = 0LL;
    vector<ll> ans(mp.size());
    auto cur = mp.begin();
    {
        rep(i, N) {
            ans[0] += w[i] * (x[i] - cur->fi);
            if(x[i] == cur->fi) add += w[i];
            else add -=w[i];
        }
        
    }
    ++cur;
    auto pre = mp.begin();
    {
        while(cur != mp.end()) {
            ll d = cur->fi - pre->fi;
            ans[cur->se] = ans[pre->se] + add * d;
            auto i = lower_bound(all(x), cur->fi) - x.begin();
            if(i < (int)x.size() && x[i] == cur->fi) {
                add += w[i] * 2;
            }
            ++cur;
            ++pre;
        }
    }
    rep(i, Q) {
        cout << ans[mp[X[i]]] << '\n';
    }
    return 0;
}