//#include <bits/stdc++.h>
#include <map>
#include <set>
#include <list>
#include <cmath>
#include <ctime>
#include <deque>
#include <queue>
#include <stack>
#include <string>
#include <bitset>
#include <cstdio>
#include <limits>
#include <vector>
#include <climits>
#include <cstring>
#include <cstdlib>
#include <fstream>
#include <numeric>
#include <sstream>
#include <cassert>
#include <iomanip>
#include <iostream>
#include <algorithm>
#include <stdio.h>
#include <fstream>
#include <unordered_map>
using namespace std;
#define int long long
#define pb push_back
#define S second
#define F first
const int N = 2e5 + 5;
const int INF = 1e18 - 1;
const int MOD = 1e9 + 7;
int n, d[N], v[N];
int q;
signed main() {
ios_base::sync_with_stdio(0);
cin.tie(0);
cin >> n >> q;
for (int i = 1; i <= n; ++ i) cin >> d[i] >> v[i];
while (q --) {
int r, vl;
cin >> r >> vl;
int mx = -1, got = 0, res = 0;
for (int i = r; i <= n; ++ i) {
if (mx < d[i]) {
mx = d[i];
got += v[i];
if (got >= vl) {
res = i;
break;
}
}
}
cout << res << '\n';
}
return 0;
}
