Untitled

#include <bits/stdc++.h>
using namespace std;

int main()
{
    int n, q, V;
    cin >> n >> q >> V;
    int c = max(n, q);
    int max = 0;
    vector<int> arr;

    arr[0] = V;
    for (int i = 1; i < n; i++)
    {
        int x, v;
        cin >> x >> v;
        if (x <= arr[i - 1])
        {
            arr.emplace_back(v + arr[i - 1]);
        }
        else
        {
            continue;
        }
        max = v + arr[i - 1];
    }

    for (int i = 0; i < q; i++)
    {
        int x;
        cin >> x;
        if ( x > max ) cout << -1 << "\n";
        else cout << lower_bound(arr.begin(), arr.end(), x) << "\n";        
    }
}