//It is made by HolseLee on 21st Sep 2018
//Luogu.org P3168
#include<cstdio>
#include<cstring>
#include<iostream>
#include<algorithm>
using namespace std;typedef long long ll;
const int N=1e5+7;
int n,m,rk[N<<1],root[N],v[N<<1],c[N<<1],cnte,tot;
struct Node {int pos,type,val;Node() {}Node(const int _x,const int _y,const int _z): pos(_x),type(_y),val(_z) {}bool operator < (const Node x) const {return pos<x.pos;}
}e[N<<1];
struct Seg {ll cnt,sum; int ls,rs;
}seg[N*40];template<typename re>inline void read(re &x)
{x=0; char ch=getchar(); bool flag=false;while( ch<'0' || ch>'9' ) {if( ch=='-' ) flag=true; ch=getchar();}while( ch>='0' && ch<='9' ) {x=x*10+ch-'0'; ch=getchar();}flag ? x=-x : 1;
}void update(int &now,int las,int type,int pos,int l,int r)
{now=++tot; seg[now]=seg[las];seg[now].sum+=(ll)(type*v[pos]); seg[now].cnt+=type;if( l==r ) return;int mid=(l+r)>>1;if( pos<=mid ) update(seg[now].ls,seg[las].ls,type,pos,l,mid);else update(seg[now].rs,seg[las].rs,type,pos,mid+1,r);
}int quary(int now,int k,int l,int r)
{if( l==r ) return seg[now].sum/seg[now].cnt*(ll)k;int mid=(l+r)>>1, s=seg[seg[now].ls].cnt;if( k<=s ) return quary(seg[now].ls,k,l,mid);else return seg[seg[now].ls].sum+quary(seg[now].rs,k-s,mid+1,r);
}int main()
{read(n),read(m);int x,y,z;for(int i=1; i<=n; ++i) {read(x), read(y), read(z);e[++cnte]=Node(x,1,z); e[++cnte]=Node(y+1,-1,z);v[i]=z;}sort(v+1,v+n+1); sort(e+1,e+cnte+1);for(int i=1; i<=cnte; ++i) rk[i]=lower_bound(v+1,v+n+1,e[i].val)-v;for(int i=1,j=1; i<=m; ++i) {while( j<=cnte && e[j].pos==i )update(c[j],c[j-1],e[j].type,rk[j],1,m), j++;root[i]=c[j-1];}ll ans=1;int kth,t;for(int i=1; i<=m; ++i) {read(t), read(x), read(y), read(z);kth=1+(x*ans+y)%z;if( kth>seg[root[t]].cnt ) printf("%lld\n", ans=seg[root[t]].sum);else printf("%lld\n", ans=quary(root[t],kth,1,m));}return 0;
}