1 #include<iostream>
 2 #include<cstdio>
 3 #include<cstring>
 4 #include<algorithm>
 5 #define N 1000006
 6 using namespace std;
 7 struct node {
 8     long long c,v,t;
 9 } s[N];
10 bool cmp(const node&a,const node&b) {
11     return a.t<b.t;
12 }
13
14 long long Time[N],f[301][90002],maxVal;
15 long long n,m;
16 long long Find(long long Judge) {
17     long long l=1,r=n,mid;
18     while(l<=r) {
19         mid=(l+r)>>1;
20         if(Time[mid]<=Judge)l=mid+1;
21         else r=mid-1;
22     }
23     return r;
24 }
25 long long Find(long long x,long long Judge) {
26     long long l=0,r=maxVal,mid;
27     while(l<=r) {
28         mid=(l+r)>>1;
29         if(f[x][mid]<=Judge)l=mid+1;
30         else r=mid-1;
31     }
32     return r;
33 }
34 long long read(){
35     long long x=0,f=1;
36     char c=getchar();
37     while(!isdigit(c)){
38         if(c=='-')f=-1;
39         c=getchar();
40     }
41     while(isdigit(c)){
42         x=(x<<3)+(x<<1)+c-'0';
43         c=getchar();
44     }
45     return x*f;
46 }
47 int main() {
48     cin>>n>>m;
49     for(long long i=1; i<=n; i++) {
50         s[i].c=read(),s[i].v=read(),s[i].t=read();
51         maxVal+=s[i].v;
52     }
53     sort(s+1,s+n+1,cmp);
54     for(long long i=1; i<=n; i++)Time[i]=s[i].t;
55     memset(f,0x3f3f3f3f,sizeof f);
56     f[0][0]=0;
57     for(long long i=1; i<=n; i++) {
58         for(long long j=maxVal; j>=0; j--) {
59             if(j>=s[i].v)f[i][j]=min(f[i-1][j],f[i-1][j-s[i].v]+s[i].c);
60             else f[i][j]=f[i-1][j];
61         }
62     }
63     for(long long i=1; i<=n; i++) {
64         for(long long j=maxVal-1; j>=0; j--) {
65             f[i][j]=min(f[i][j],f[i][j+1]);
66         }
67     }
68     for(long long i=1; i<=m; i++) {
69         long long T,M;
70         T=read(),M=read();
71         cout<<Find(Find(T),M)<<'\n';
72     }
73     return 0;
74 }
75
76 //bag