Problem: Wall Painting

Here stands a wall made of a number of vertical panels. The panels are not painted yet.

You have a number of robots each of which can paint panels in a single color, either red, green, or blue. Each of the robots, when activated, paints panels between a certain position and another certain position in a certain color. The panels painted and the color to paint them are fixed for each of the robots, but which of them are to be activated and the order of their activation can be arbitrarily decided.

You’d like to have the wall painted to have a high aesthetic value. Here, the aesthetic value of the wall is defined simply as the sum of aesthetic values of the panels of the wall, and the aesthetic value of a panel is defined to be:

* 0, if the panel is left unpainted.
* The bonus value specified, if it is painted only in a single color, no matter how many times it is painted.
* The penalty value specified, if it is once painted in a color and then overpainted in one or more different colors.



Input

The input consists of a single test case of the following format.


$n$ $m$ $x$ $y$
$c_1$ $l_1$ $r_1$
.
.
.
$c_m$ $l_m$ $r_m$


Here, $n$ is the number of the panels ($1 \leq n \leq 10^9$) and $m$ is the number of robots ($1 \leq m \leq 2 \times 10^5$). $x$ and $y$ are integers between $1$ and $10^5$, inclusive. $x$ is the bonus value and $-y$ is the penalty value. The panels of the wall are consecutively numbered $1$ through $n$. The $i$-th robot, when activated, paints all the panels of numbers $l_i$ through $r_i$ ($1 \leq l_i \leq r_i \leq n$) in color with color number $c_i$ ($c_i \in \\{1, 2, 3\\}$). Color numbers 1, 2, and 3 correspond to red, green, and blue, respectively.

Output

Output a single integer in a line which is the maximum achievable aesthetic value of the wall.

Sample Input 1


8 5 10 5
1 1 7
3 1 2
1 5 6
3 1 4
3 6 8


Sample Output 1


70


Sample Input 2


26 3 9 7
1 11 13
3 1 11
3 18 26


Sample Output 2


182


Sample Input 3


21 10 10 5
1 10 21
3 4 16
1 1 7
3 11 21
3 1 16
3 3 3
2 1 17
3 5 18
1 7 11
2 3 14


Sample Output 3


210


Sample Input 4


21 15 8 7
2 12 21
2 1 2
3 6 13
2 13 17
1 11 19
3 3 5
1 12 13
3 2 2
1 12 15
1 5 17
1 2 3
1 1 9
1 8 12
3 8 9
3 2 9


Sample Output 4


153






Example

Input

8 5 10 5
1 1 7
3 1 2
1 5 6
3 1 4
3 6 8


Output

70

Solution (in CPP):

Solution:
#include<bits/stdc++.h>
using namespace std;

#define REP(i,n) for(ll i=0;i<(n);i++)
#define ALL(v) v.begin,v.end()
using ll=long long;


struct RangeMaxQuery {
  using type = ll;
  static type id() { return -1e17; }
  static type op(const type &lhs, const type &rhs) { return max(lhs, rhs); }
};

template<typename M>
class SegmentTree {
  using T = typename M::type;
  int n;
  vector<T> node;

public:
  SegmentTree(const vector<T> &v) {
    n = 1;
    while (n < int(v.size())) n *= 2;
    node.resize(2 * n, M::id());

    for (int i = 0; i < (int) v.size(); i++) node[i + n] = v[i];
    for (int i = n - 1; i >= 0; i--) {
      node[i] = M::op(node[2 * i], node[2 * i + 1]);
    }
  }

  SegmentTree(int _n) {
    n = 1;
    while (n < _n) n *= 2;
    node.resize(2 * n, M::id());
  }

  // seg[x] = val
  void update(int x, T val) {
    x += n;
    node[x] = val;
    while (x >>= 1) {
      node[x] = M::op(node[2 * x], node[2 * x + 1]);
    }
  }

  // seg[x] = oop(seg[x], val)
  void operation(int x, T val) {
    x += n;
    node[x] = M::op(node[x], val);
    while (x >>= 1) {
      node[x] = M::op(node[2 * x], node[2 * x + 1]);
    }
  }

  // [l, r)
  T query(int l, int r) {
    l += n;
    r += n;
    T retl = M::id(), retr = M::id();
    while (l < r) {
      if (l & 1) retl = M::op(retl, node[l++]);
      if (r & 1) retr = M::op(node[--r], retr);
      l >>= 1;
      r >>= 1;
    }
    return M::op(retl, retr);
  }
};


struct CLR{
  int c,l,r;
};

map<int,ll> compress(vector<int> vs){
  sort(vs.begin(),vs.end());
  vs.erase(unique(vs.begin(),vs.end()),vs.end());
  map<int,ll> res;
  for(int i=0;i<vs.size();i++){
    res[vs[i]]=i;
  }
  return res;
}

using RMQ=SegmentTree<RangeMaxQuery>;

const ll INF=1e17;
int main(){
  ll n;
  int m;
  ll x,y;
  cin>>n>>m>>x>>y;

  vector<CLR> clr(m);
  for(int i=0;i<m;i++){
    cin>>clr[i].c>>clr[i].l>>clr[i].r;
    clr[i].c--;
    clr[i].l--;
  }

  auto cmp=[&](CLR lhs,CLR rhs){
    return lhs.l<rhs.l;
  };
  
  sort(clr.begin(),clr.end(),cmp);

  map<int,ll> mp;
  {
    vector<int> vs;
    vs.push_back(0);
    for(int i=0;i<m;i++){
      vs.push_back(clr[i].l);
      vs.push_back(clr[i].r);
    }
    mp=compress(vs);
  }

  vector<RMQ> simple;
  for(int i=0;i<3;i++) simple.emplace_back(mp.size());
  for(int i=0;i<3;i++) simple[i].update(0,0);
  
  vector<RMQ> hennano;
  for(int i=0;i<3;i++) hennano.emplace_back(mp.size());
  for(int i=0;i<3;i++) hennano[i].update(0,0);
  
  vector<RMQ> onnaji;
  for(int i=0;i<3;i++) onnaji.emplace_back(mp.size());
  for(int i=0;i<3;i++) onnaji[i].update(0,0);

  ll res=-INF;
  for(auto& e:clr){
    ll score=-INF;
    for(int i=0;i<3;i++){
     ll v1=hennano[i].query(mp[e.l],mp[e.r]+1)+e.l*(y+2*x)+x*(e.r-e.l);
     ll v0=simple[i].query(0,mp[e.l]+1)+x*(e.r-e.l);
     score=max({score,v0,v1});
    }
    ll v=onnaji[e.c].query(mp[e.l],mp[e.r]+1)+e.l*x+x*(e.r-e.l);
    score=max(score,v);
    res=max(res,score);

    if(score>simple[e.c].query(mp[e.r],mp[e.r]+1)){
      simple[e.c].update(mp[e.r],score);
      hennano[e.c].update(mp[e.r],score-e.r*(2*x+y));
      onnaji[e.c].update(mp[e.r],score-e.r*x);
    }
    
  }
  
  cout<<res<<endl;
  
  return 0;
}