#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
#include <unordered_set>
using namespace std;

using ll = long long;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

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

    int N, Q;
    cin >> N >> Q;
    vector<pair<int, int>> dat;
    ll left_sum = 0, right_sum = 0, left_weight = 0, right_weight = 0;
    for(int i = 0; i < N; ++i){
        int x, w;
        cin >> x >> w;
        dat.emplace_back(x, w);
        right_sum += (ll)x * w;
        right_weight += w;
    }
    for(int i = 0; i < Q; ++i){
        int x;
        cin >> x;
        dat.emplace_back(x, -i);
    }
    sort(begin(dat), end(dat));
    vector<ll> ans(Q);
    for(auto [x, w] : dat){
        if(w > 0){
            left_sum += (ll)x * w; left_weight += w;
            right_sum -= (ll)x * w; right_weight -= w;
        }
        else{
            ans[-w] = (left_weight - right_weight) * x - left_sum + right_sum;
        }
    }
    for(int i = 0; i < Q; ++i)  cout << ans[i] << '\n';

    return 0;
}