#include<bits/stdc++.h> #define int long long using namespace std; int n,q,l,r,a[200005],op[200005],x[200005],s[200005],t[200005],b[200005]; int check(int w){ if(b[w])return a[w]; for(int i=1;i<=q;i++){ if(op[i]==1){ if(a[w]>=x[i])a[w]+=s[i],a[w]*=t[i]; } else{ if(a[w]<=x[i])a[w]-=s[i],a[w]/=t[i]; } } b[w]=1; return a[w]; } int erfen(int w){ if(check(1)>w){ return 0; } int l=1,r=n,mid,ret; while(l<=r){ mid=(l+r)/2; if(check(mid)<=w){ ret=mid; l=mid+1; } else r=mid-1; } return ret; } signed main(){ scanf("%lld%lld%lld%lld",&n,&q,&l,&r); for(int i=1;i<=n;i++){ scanf("%d",&a[i]); } sort(a+1,a+n+1); for(int i=1;i<=q;i++){ scanf("%lld%lld%lld%lld",&op[i],&x[i],&s[i],&t[i]); } printf("%lld",erfen(r)-erfen(l-1)); return 0; }