离散化注意，
注意把栈开大。
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<iostream>
#include<cmath>
#include<cctype>
#include<ctime>
#include<iomanip>
#include<vector>
#include<string>
#include<queue>
#include<stack>
#include<map>
#include<sstream>
#include<functional>
#include<algorithm>
using namespace std;
#define For(i,n) for(int i=1;i<=n;i++)
#define Fork(i,k,n) for(int i=k;i<=n;i++)
#define Rep(i,n) for(int i=0;i<n;i++)
#define ForD(i,n) for(int i=n;i;i--)
#define ForkD(i,k,n) for(int i=n;i>=k;i--)
#define RepD(i,n) for(int i=n;i>=0;i--)
#define Forp(x) for(int p=Pre[x];p;p=Next[p])
#define Forpiter(x) for(int &p=iter[x];p;p=Next[p])
#define Lson (o<<1)
#define Rson ((o<<1)+1)
#define MEM(a) memset(a,0,sizeof(a));
#define MEMI(a) memset(a,127,sizeof(a));
#define MEMi(a) memset(a,128,sizeof(a));
#define INF (2139062143)
#define F (1000000007)
#define pb push_back
#define mp make_pair
#define fi first
#define se second
#define vi vector<int>
#define pi pair<int,int>
#define SI(a) ((a).size())
#define Pr(kcase,ans) printf("Case #%d: %I64d\n",kcase,ans);
#define PRi(a,n) For(i,n-1) cout<<a[i]<<' '; cout<<a[n]<<endl;
#define PRi2D(a,n,m) For(i,n) { \
For(j,m-1) cout<<a[i][j]<<' ';\
cout<<a[i][m]<<endl; \
}
#pragma comment(linker, "/STACK:102400000,102400000")
typedef long long ll;
typedef long double ld;
typedef unsigned long long ull;
ll mul(ll a,ll b){return (a*b)%F;}
ll add(ll a,ll b){return (a+b)%F;}
ll sub(ll a,ll b){return ((a-b)%F+F)%F;}
void upd(ll &a,ll b){a=(a%F+b%F)%F;}
int read()
{
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if (ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) { x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
#define MAXN (200010)
int n,m;
ll a2[MAXN];
struct node
{
node *ch[2];
int siz;
ll v;
node(){ch[0]=ch[1]=NULL;siz=0;v=0;}
inline void update()
{
siz=v=0;
if (ch[0]) siz+=ch[0]->siz,v+=ch[0]->v;
if (ch[1]) siz+=ch[1]->siz,v+=ch[1]->v;
}
}*null=new node(),*root[MAXN]={NULL},q[MAXN<<4];
int q_s;
inline void make_node(node *&y,node *&x,int l,int r,int t,int typ)
{
if (x==NULL) x=null;
y=&q[++q_s];
y->ch[0] = y->ch[1] =null; y->v=y->siz=0;
int m=(l+r)>>1;
if (l==r)
{
*y=*x;
y->siz+=typ; y->v+=t*typ;
return;
}
if (t<=a2[m])
{
make_node(y->ch[0],x->ch[0],l,m,t,typ);
y->ch[1]=x->ch[1];
y->update();
}
else
{
make_node(y->ch[1],x->ch[1],m+1,r,t,typ);
y->ch[0]=x->ch[0];
y->update();
}
}
ll Ans=0;
inline void find(node *&x2,int l,int r,int k)
{
if (x2==NULL) return;
if (l==r) {Ans+=a2[l]*min(x2->siz,k);return;}
int m=(l+r)>>1;
int ls=0;
if (x2->ch[0]) ls+=x2->ch[0]->siz;
if (ls>=k) find(x2->ch[0],l,m,k);
else {
find(x2->ch[1],m+1,r,k-ls);
if (x2->ch[0]) Ans+=x2->ch[0]->v;
}
}
pair<int ,pi > ask[MAXN];
int main()
{
// freopen("E.in","r",stdin);
// freopen(".out","w",stdout);
int X; ll P;
while(~scanf("%d%d%d%lld",&n,&m,&X,&P)) {
null->ch[0]=null; null->ch[1]=null;
For(i,n) {
int l=read(),r=read(),d=read();
ask[i]=mp(l,mp(1,d) );
ask[i+n]=mp(r+1,mp(-1,d) );
a2[i]=d;
}
sort(ask+1,ask+1+2*n);
sort(a2+1,a2+1+n);
int size=unique(a2+1,a2+1+n)-(a2+1);
root[0]=null;
q_s=0;
For(i,2*n)
{
make_node(root[i],root[i-1],1,size,ask[i].se.se,ask[i].se.fi);
}
ll Pre=1;
int x,a,b,c;
For(i,m)
{
scanf("%d%d%d%d",&x,&a,&b,&c);
int K=(a*Pre+b)%c;
int pos=upper_bound(ask+1,ask+1+2*n,mp((int)x,mp(2,0)))-(ask+1);
if (!pos||!K) {
puts("0"); Pre=0;
continue;
}
Ans=0;
K=min(K,root[pos]->siz);
find(root[pos],1,size,K);
if (Pre>P) Ans*=2;
printf("%I64d\n",Pre=Ans);
}
}
return 0;
}
