#include<bits/stdc++.h>
#define ls(x) t[x].ch[0]
#define rs(x) t[x].ch[1]
#define int long long
using namespace std;
const int N=2e5+5;
int m,n,idx,p[N],root[N];
vector<int>st[N],ed[N];
struct node{
	int ch[2];
	int cnt,sum;
}t[N<<5];
void change(int x,int &y,int l,int r,int pos,int val)
{
	y=++idx;t[y]=t[x];
	t[y].cnt+=val?1:-1;
	t[y].sum+=val?val:val*-1;
	if (l==r) return;
	int mid=l+r>>1;
	if (pos<=mid) change(ls(x),ls(y),l,mid,pos,val);
	else change(rs(x),rs(y),mid+1,r,pos,val);
}
int query(int x,int l,int r,int k)
{
    if (l==r) return t[x].sum -max(0ll,t[x].cnt -k)*l;
	int s=t[ls(x)].cnt;
	int mid=l+r>>1;
	if (k<=s) return query(ls(x),l,mid,k);
	else return query(rs(x),mid+1,r,k-s)+t[ls(x)].sum ;  
}
signed main()
{
	cin>>m>>n;
	for (int i=1;i<=m;i++)
	{
		int s,e;scanf("%lld%lld%lld",&s,&e,&p[i]);
		st[s].push_back(i);ed[e+1].push_back(i);
	}
	for (int i=1;i<=n+1;i++)
	{
		root[i]=root[i-1];
		for (int j=0;j<st[i].size();j++)
			change(root[i],root[i],1,1e7,p[st[i][j]],p[st[i][j]]);
		for (int j=0;j<ed[i].size();j++)
		  change(root[i],root[i],1,1e7,p[ed[i][j]],-1*p[ed[i][j]]);
	}
	int pre=1;
	for (int i=1;i<=n;i++)
	{
		int x,a,b,c;scanf("%lld%lld%lld%lld",&x,&a,&b,&c);
		int k=1+(1ll*a*pre+b)%c;
		if (k>t[root[x]].cnt) pre=t[root[x]].sum;
		else pre=query(root[x],1,1e7,k);
		printf("%lld\n",pre);
	}
}