// #pragma GCC diagnostic warning "-std=c++11"
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize ("O3")
// #pragma GCC optimization ("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx,avx2,fma")
#include <bits/stdc++.h>
using namespace std;
 
#define int long long
#define eb emplace_back
#define mp make_pair
#define pb push_back
#define pp pop_back
#define endl '\n'
#define ff first
#define ss second
#define stop exit(0)
#define sz(x) (int)x.size()
#define pause system("pause")
#define all(x) (x).begin(),(x).end()
#define deb(x) cout << #x << "-" << x  << endl
 
typedef char chr;
typedef string str;
typedef long long ll;
typedef vector <int> vii;
typedef pair <int,int> pii;
 
const long long INF = LLONG_MAX;
const int inf = INT_MAX;
const int mod = 998244353;
const int MOD = 1e9 + 7;
const int dx[] = {0,0,-1,1};
const int dy[] = {-1,1,0,0};
const double PI = 2 * acos(0.0);

const int N = 2e5 + 5;

int n,q;
int d[N],c[N];
pair <pii,int> b[N];
int cur,ans;
int pref[N],answer[N];
vii v;

inline void test_case () {  
    
    cin >> n >> q;
    for (int i = 1; i <= n; i++) {
        cin >> d[i] >> c[i];
    }
    
    for (int i = 1; i <= q; i++) {
        cin >> b[i].ff.ff >> b[i].ff.ss;
        b[i].ss = i;
    }
    sort(b+1,b+1+q,greater<pair<pii,int>>());
    cur = 1;
    v.pb(1);
    for (int i = n; i >= 1; i--) {
        while (sz(v) > 1 && d[i] >= d[v.back()]) {
            v.pp();
        }
        v.pb(i);
        pref[sz(v)-1] = pref[sz(v)-2] + c[i];
        while (i == b[cur].ff.ff) {
            ans = INF;
            int l = 1; int r = sz(v)-1;
            while (l <= r) {
                int mid = (l+r)/2;
                if (pref[sz(v)-1] - pref[mid-1] >= b[cur].ff.ss) {
                    ans = v[mid];
                    l = mid + 1;
                } else {
                    r = mid - 1;
                }
            }
            answer[b[cur].ss] = ans;
            cur++;
        }
    }
    for (int i = 1; i <= q; i++) {
        if (answer[i] == INF) {
            cout << 0 << endl;
            continue;
        }
        cout << answer[i] << endl;
    }
    

}
 
signed main () {
 
    ios_base :: sync_with_stdio(0);
    cin.tie(0); cout.tie(0);
    
    int T = 1;
    // cin >> T;
    while(T--) {
        test_case();
    }
    
    return 0;
 
}