#include <algorithm>
#include <iostream>
#include <vector>

using namespace std;

using ll = long long;

struct glad {
    ll pow, inc;

    bool operator <(glad const& rhs) const {
        return pow < rhs.pow;
    }
};

int main() {
    int n, q;
    cin >> n >> q;

    vector<glad> g(n);

    for (auto& c : g)
        cin >> c.pow >> c.inc;

    sort(g.begin(), g.end());

    ll inc = 0;

    for (auto& c : g) {
        c.pow -= inc;
        inc += c.inc;
    }

    vector<ll> req(n);

    req[0] = g[0].pow;

    for (int i = 1; i < n; i++)
        req[i] = max(req[i - 1], g[i].pow);

    for (int i = 0; i < q; i++) {
        int p;
        cin >> p;

        cout << upper_bound(req.begin(), req.end(), p) - req.begin() << " ";
    }

    cout << "\n";
}