#pragma GCC optimize("O3") #include <bits/stdc++.h> #define ll long long #define str string #define pb push_back #define pf push_front #define in insert #define all(v) v.begin(),v.end() #define fastIO ios_base::sync_with_stdio(false); cin.tie(0); cout.tie(0); const int sz=1000000,INF=1000000000; using namespace std; void solve() { ll n,m,num1,num2,Num1,Num2,ans; cin>>n>>m; vector<ll>nums1,nums2,prefs(n+1,0); for(int i=0;i<n;i++) { cin>>num1>>num2; nums1.pb(num1),nums2.pb(num2); } for(int i=0;i<n;i++) { prefs[i+1]=prefs[i]+nums2[i]; } for(int i=0;i<m;i++) { cin>>Num1>>Num2; if(prefs[n]-prefs[Num1-1]<Num2) { ans=0; } else { ans=lower_bound(all(prefs),prefs[Num1-1]+Num2)-prefs.begin(); } cout<<ans<<"\n"; } } int main() { fastIO; ll t=1; //cin>>t; while(t--) { solve(); } }