#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
typedef unsigned long long ull;
#define MASK(i) (1LL << (i))
#define GETBIT(mask, i) (((mask) >> (i)) & 1)
#define ALL(v) (v).begin(), (v).end()
#define block_of_code if(true)
ll max(ll a, ll b){return (a > b) ? a : b;}
ll min(ll a, ll b){return (a < b) ? a : b;}
ll gcd(ll a, ll b){return __gcd(a, b);}
ll lcm(ll a, ll b){return a / gcd(a, b) * b;}
ll LASTBIT(ll mask){return (mask) & (-mask);}
int pop_cnt(ll mask){return __builtin_popcountll(mask);}
int ctz(ull mask){return __builtin_ctzll(mask);}
int logOf(ull mask){return 63 - __builtin_clzll(mask);}
mt19937_64 rng(chrono::high_resolution_clock::now().time_since_epoch().count());
ll rngesus(ll l, ll r){return l + (ull) rng() % (r - l + 1);}
double rngesus_d(double l, double r){
double cur = rngesus(0, MASK(60) - 1);
cur /= MASK(60) - 1;
return l + cur * (r - l);
}
template <class T1, class T2>
bool maximize(T1 &a, T2 b){
if (a < b) {a = b; return true;}
return false;
}
template <class T1, class T2>
bool minimize(T1 &a, T2 b){
if (a > b) {a = b; return true;}
return false;
}
template <class T>
void printArr(T container, string separator = " ", string finish = "\n", ostream &out = cout){
for(auto item: container) out << item << separator;
out << finish;
}
template <class T>
void remove_dup(vector<T> &a){
sort(ALL(a));
a.resize(unique(ALL(a)) - a.begin());
}
const int INF = 1e9 + 69;
const int N = 1e5 + 69, LOG_N = 17;
int n, q;
int d[N], c[N];
int nxt[LOG_N][N];
ll sum[LOG_N][N];
int main(void){
ios::sync_with_stdio(0);cin.tie(0); cout.tie(0);
clock_t start = clock();
cin >> n >> q;
for(int i = 1; i<=n; ++i) cin >> d[i] >> c[i];
d[n+1] = c[n+1] = sum[0][n+1] = INF;
nxt[0][n+1] = n+1;
vector<int> st = {n + 1};
for(int i = n; i>=1; --i){
while(d[st.back()] <= d[i]) st.pop_back();
nxt[0][i] = st.back();
sum[0][i] = c[i];
st.push_back(i);
}
for(int j = 1; j < LOG_N; ++j) for(int i = 1; i<=n+1; ++i){
nxt[j][i] = nxt[j-1][nxt[j-1][i]];
sum[j][i] = sum[j-1][i] + sum[j-1][nxt[j-1][i]];
}
while(q--){
int r, v; cin >> r >> v;
for(int j = LOG_N - 1; j>=0; --j){
if (sum[j][r] < v) {
v -= sum[j][r];
r = nxt[j][r];
}
}
r %= n+1;
cout << r << "\n";
}
cerr << "Time elapsed: " << clock() - start << " ms\n";
return 0;
}
