#include <bits/stdc++.h>

using namespace std;

using ll = long long;

const int N = 4e5+5;

struct segt{
	ll t[N<<2];
	void pu(int k){
		t[k]=max(t[k<<1],t[k<<1|1]);
	}
	void bd(int k,int l,int r){
		t[k]=-1e18;
		if (!l) t[k]=0;
		if (l==r) return;
		int mid=l+r>>1;
		bd(k<<1,l,mid);
		bd(k<<1|1,mid+1,r);
		pu(k);
	}
	void upd(int k,int l,int r,int p,ll v){
		if(l==r){
			t[k]=max(t[k],v);
			return;
		}
		int mid=l+r>>1;
		if (p<=mid) upd(k<<1,l,mid,p,v);
		else upd(k<<1|1,mid+1,r,p,v);
		pu(k);
	}
	ll qy(int k,int l,int r,int ql,int qr){
		if (ql<=l && r<=qr) return t[k];
		if (r<ql || l>qr) return -1e18;
		int mid=l+r>>1;
		return max(qy(k<<1,l,mid,ql,qr),qy(k<<1|1,mid+1,r,ql,qr));
	}
} t1[3],t2[3],t3[3];

ll n,m,X,Y;
struct node {
	int l,r,c;
} a[N];
bool cmp(node x,node y){
	return x.l<y.l;
}

int main(){
	ios::sync_with_stdio(false);
	cin.tie(0);

	cin>>n>>m>>X>>Y;
	vector<int> v;
	for (int i=1; i<=m; i++){
		cin>>a[i].c>>a[i].l>>a[i].r;
		v.push_back(a[i].l);
		v.push_back(a[i].r);
		a[i].c--;
	}
	sort(a+1,a+1+m,cmp);
	sort(v.begin(),v.end());
	v.erase(unique(v.begin(),v.end()),v.end());
	for (int i=1; i<=m; i++){
		a[i].l=lower_bound(v.begin(),v.end(),a[i].l)-v.begin()+1;
		a[i].r=lower_bound(v.begin(),v.end(),a[i].r)-v.begin()+1;
	}
	int cnt=v.size();
	#define al 1,0,cnt
	for (int i=0; i<3; i++){
		t1[i].bd(al);
		t2[i].bd(al);
		t3[i].bd(al);
	}
	ll ans=-1e18;
	for (int i=1; i<=m; i++){
		int l=a[i].l;
		int r=a[i].r;
		int c=a[i].c;
		ll tmp=-1e18;
		for (int j=0; j<3; j++){
			if (j==c){
				tmp=max({tmp,t1[j].qy(al,0,l-1)+X*(v[r-1]-v[l-1]+1),t2[j].qy(al,l,r-1)+X*v[r-1]});
			}
			else{
				tmp=max({tmp,t1[j].qy(al,0,l-1)+X*(v[r-1]-v[l-1]+1),t3[j].qy(al,l,r-1)+(X+Y)*(v[l-1]-1)+X*v[r-1]});
			}
		}
		ans=max(ans,tmp);
		t1[c].upd(al,r,tmp);
		t2[c].upd(al,r,tmp-X*v[r-1]);
		t3[c].upd(al,r,tmp-(X+X+Y)*v[r-1]);
	}
	cout<<ans<<"\n";
	return 0;
}

// TRY! TRY! TRY!

/*
Think twice before coding. Have you overkilled?
Think twice before submitting.
Check on the samples and constraints carefully.
*/

/*
Be brave to guess.
Is your former/first approach correct?
Follow your intuition.
Use a notebook to note down your ideas and check whether they are correct.
*/

/*
A simple brute force may work? There is some limit on the answer?
Try to find patterns.
*/