#include <bits/stdc++.h>

using namespace std;

int main()
{
    //ifstream cin("in.txt");
    int n;
    cin >> n;
    int q;
    cin >> q;

    vector<pair<int, int>> szen(n + 1);
    for(int i = 1; i <= n; i++){
        cin >> szen[i].first >> szen[i].second;
    }
    sort(szen.begin(), szen.end());
    /*for(int i = 1; i <= n; i++){
        cout << szen[i].first << " " << szen[i].second << '\n';
    }
    cout << '\n';*/
    vector<int> hps(n + 1);
    hps[1] = szen[1].first;
    int m = szen[1].second;
    for(int i = 2; i <= n; i++){
        hps[i] = max(hps[i - 1], szen[i].first - m);
        m += szen[i].second;
    }
    /*for(int i = 1; i <= n; i++){
        cout << hps[i] << " ";
    }*/
    while(q--){
        int a;
        cin >> a;
        cout << upper_bound(hps.begin(), hps.end(), a) - hps.begin() - 1 << " ";
    }



    return 0;
}