rt

#include<bits/stdc++.h>
using namespace std;
int n,t,x,y,sumc,sumf,sumb;
struct flo{
	int cost,fr,be;
}a[510];
bool cmp(flo x,flo y){
	return x.cost<=y.cost;
}int main(){
	int i;
	cin>>n>>t;
	for(i=1;i<=n;i++)cin>>a[i].cost>>a[i].fr>>a[i].be;
	sort(a+1,a+1+n,cmp);
	while(t--){
		sumc=sumf=sumb=0;
		cin>>x>>y;
		for(i=1;i<=n;i++){
			sumc=sumc+a[i].cost;
			sumf=sumf+a[i].fr;
			sumb=sumb+a[i].be;
			if(sumc>x){
				sumb=sumb-a[i].be;
				break;
			}
		}cout<<sumb<<endl;
	}return 0;
}