#include <bits/stdc++.h>
using namespace std;
#define ll long long
#define pb push_back

const int mxN = 3e5 + 5;
ll n,q,d[mxN],c[mxN],p[mxN][50],par[mxN][50];
stack<ll> st;

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);
	cout.tie(0);
	cin >> n >> q;
	for(int i = 1; i <= n; i++){
		cin >> d[i] >> c[i];
	}
	for(int i = n; i >= 1; i--){
		while(!st.empty()){
			if(d[i] >= d[st.top()]) st.pop();
			else break;
		} 
		if(!st.empty()){
			p[i][0] = c[i];
			par[i][0] = st.top();
			for(int j = 1; j <= 20; j++){
				par[i][j] = par[par[i][j - 1]][j - 1];
				p[i][j] = p[i][j - 1] + p[par[i][j - 1]][j - 1];
			}
		}
		else for(int j = 0; j <= 20; j++) p[i][j] = c[i];
		st.push(i);
	}
//	cout << '\n' << p[1][1] << '\n' << '\n';
	while(q--){
		ll a,b;
		cin >> a >> b;
		if(p[a][20] < b){
			cout << 0 << '\n';
			continue;
		}
		for(int i = 20; i >= 0; i--){
			if(p[a][i] < b){
				b -= p[a][i];
				a = par[a][i];
			} 
		}
		cout << a << '\n';
	}
}