#include <bits/stdc++.h>

using namespace std;
using ll = long long;
using VI = vector<int>;
using VL = vector<ll>;
using PII = std::pair<int, int>;
using PLL = std::pair<ll, ll>;

#define rep(i, n) for (int i = 0; i < (int)(n); i++)
#define repr(i, n) for (int i = (int)(n)-1; i >= 0; i--)
#define rep2(i, s, n) for (int i = (s); i < (int)(n); i++)
#define allpt(v) (v).begin(), (v).end()
#define allpt_c(v) (v).cbegin(), (v).cend()
#define allpt_r(v) (v).rbegin(), (v).rend()

const int mod = 1e9 + 7;
const string wsp = " ";
const string tb = "\t";
const string rt = "\n";

template <typename T>
void show1dvec(const vector<T> &v)
{
    if (v.size() == 0)
        return;
    int n = v.size() - 1;
    rep(i, n) cout << v[i] << wsp;
    cout << v[n] << rt;
    return;
}

template <typename T>
void show2dvec(const vector<vector<T>> &v)
{
    int n = v.size();
    rep(i, n) show1dvec(v[i]);
}

template <typename T, typename S>
void show1dpair(const vector<pair<T, S>> &v)
{
    int n = v.size();
    rep(i, n) cout << v[i].first << wsp << v[i].second << rt;
    return;
}

template <typename T, typename S>
void pairzip(const vector<pair<T, S>> &v, vector<T> &t, vector<T> &s)
{
    int n = v.size();
    rep(i, n)
    {
        t.push_back(v[i].first);
        s.push_back(v[i].second);
    }
    return;
}

template <typename T>
void maxvec(vector<T> &v)
{
    T s = v[0];
    int n = v.size();
    rep(i, n - 1)
    {
        if (s > v[i + 1])
        {
            v[i + 1] = s;
        }
        s = v[i + 1];
    }
}

template <typename T, typename S>
bool myfind(T t, S s)
{
    return find(t.cbegin(), t.cend(), s) != t.cend();
}



void cumsum(VL &v)
{
    ll s = 0;
    rep(i, v.size())
    {
        s += v[i];
        if (s >= mod) s -= mod;
        v[i] = s;
    }
}


int main()
{


#ifdef DEBUG
    cout << "DEBUG MODE" << endl;
    ifstream in("input.txt"); //for debug
    cin.rdbuf(in.rdbuf());    //for debug
#endif

    int n, q, qi;
    cin >> n >> q;
    ll totalw, costx0 = 0;
    VL diff, x_list(n), w_list(n), cost_in_x;
    rep(i, n)
    {
        cin >> x_list[i] >> w_list[i];
    }
    totalw = -accumulate(allpt_c(w_list), 0ll);
    diff.push_back(totalw);
    rep(i, n)
    {
        totalw += 2 * w_list[i];
        diff.push_back(totalw);
    }
    rep(i, n)
    {
        costx0 += (x_list[i] - x_list[0]) * w_list[i];
    }
    cost_in_x.push_back(costx0);
    rep2(i, 1, n)
    {
        costx0 += (x_list[i] - x_list[i - 1]) * diff[i];
        cost_in_x.push_back(costx0);
    }


    rep(i, q)
    {
        cin >> qi;
        if (x_list[0] > qi)
            cout << -diff[0] * (x_list[0] - qi) + cost_in_x[0] << rt;
        else
        {
            auto a = upper_bound(allpt_c(x_list), qi) - x_list.cbegin();
            cout << diff[a] * (qi - x_list[a - 1]) + cost_in_x[a - 1] << rt;
        }
        
        
    }


    return 0;
}