Untitled

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

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

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

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