// All subtask (100point)

#include <iostream>
#include <vector>
#include <climits>
#include <stack>
using namespace std;

#define int long long

vector <pair <int, int> > v;
vector <vector <int> > gr;
vector <vector <int> > bin;
vector <vector <int> > binreq;

void dfs (int p, int par) {
    bin[p][0] = par;
    for (int i = 1; i < 17; i++)
        bin[p][i] = bin[bin[p][i - 1]][i - 1];
    
    binreq[p][0] = v[p].second;
    for (int i = 1; i < 17; i++)
        binreq[p][i] = binreq[p][i - 1] + binreq[bin[p][i - 1]][i - 1];
    
    for (int& e : gr[p])
        if (e != par)
            dfs (e, p);
}

signed main () {
    int n = 0, q = 0;
    cin >> n >> q;

    gr.resize (n + 2);
    bin.resize (n + 2, vector <int> (17));
    binreq.resize (n + 2, vector <int> (17));
    v.reserve (n + 2);
    v.resize (n + 1);
    for (int i = 1; i <= n; i++)
        cin >> v[i].first >> v[i].second;
    v.push_back ({INT_MAX, INT_MAX});

    vector <int> ri (n + 2, n + 1);
    {
        stack <int> s;
        for (int i = n + 1; i >= 1; i--) {
            while (s.size() && v[s.top()].first <= v[i].first)
                s.pop();
            
            if (s.size())
                ri[i] = s.top();
            
            s.push (i);
        }
    }

    for (int i = 1; i <= n; i++) {
        // parent = ri[i]
        gr[ri[i]].push_back (i);
        gr[i].push_back (ri[i]);
    }

    dfs (n + 1, 0);

    for (int i = 1; i <= q; i++) {
        int ind = 0, vi = 0;
        cin >> ind >> vi;

        for (int p = 16; p >= 0; p--)
            if (binreq[ind][p] < vi) {
                vi -= binreq[ind][p];
                ind = bin[ind][p];
            }
        
        if (ind == n + 1)
            cout << 0 << '\n';
        else
            cout << ind << '\n';
    }
}