#include <bits/stdc++.h>
using namespace std;
using ll=long long;
bool r(pair<ll,ll> a, pair<ll,ll> b){
    if (a.first==b.first) return(a.second>b.second);
    return (a.first<b.first);
}
int main()
{
    int n,m;
    cin>>n>>m;
    vector<pair<ll,ll>> s;
    vector<ll> b;
    for (int i=0; i<n;i++){
        int a,b;
        cin>>a>>b;
        s.push_back({a,b});
    }
    sort(s.begin(),s.end(),r);
    int kv=s[0].second;
    vector<ll> p={s[0].second};
    for (int i=1;i<n;i++){
        p.push_back(max(s[i].first-kv,p[i-1]));
        kv+=s[i].second;
    }
    for (int x:p) cout<<x<<" ";
    int ans;
    for (int i=0;i<n;i++){
        ll x;
        cin>>x;
        cout<<lower_bound(p.begin(),p.end(),x)-p.begin()<<" ";
    }


}