#include <algorithm>
#include <bits/stdc++.h>
using namespace std;
using ll=long long;

int main() {
    ios::sync_with_stdio(false); cin.tie(0);
	int n,q; cin >> n >> q;
    vector<pair<ll,ll>> vec(n);
    for(auto& [a,b]:vec)
        cin >> a >> b;
    sort(vec.begin(), vec.end());
    vector<ll> req(n);
    req[0]=vec[0].first;
    ll gained=0;
    for(int i=1; i<n; i++)
    {
        gained+=vec[i-1].second;
        req[i]=max(req[i-1], vec[i].first-gained);
    }
    for(int i=0; i<q; i++)
    {
        int a; cin >> a;
        cout << upper_bound(req.begin(), req.end(), a)-req.begin() << " ";
    }
}