#include <bits/stdc++.h>
using namespace std;
using ll = long long;
int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, q;
	cin >> n >> q;
	vector<pair<ll, ll>> v(n);
	for (auto& x : v) {
		cin >> x.first >> x.second;
	}
	sort(v.begin(), v.end());
	vector<ll> m(n + 1);
	ll s = 0;
	for (int i = 1; i <= n; i++) {
		ll d = v[i - 1].first - s;
		if (i == 1) {
			m[i] = d;
		} else {
			m[i] = max(m[i - 1], d);
		}
		s += v[i - 1].second;
	}
	for (int i = 0; i < q; i++) {
		ll c;
		cin >> c;
		auto p = upper_bound(m.begin() + 1, m.end(), c);
		cout << p - (m.begin() + 1);
		if (i < q - 1) {
			cout << ' ';
		}
	}
	cout << '\n';
	return 0;
}