#include <bits/stdc++.h>

using namespace std;

using int64 = long long;
const int mod = 104857601;


const int64 infll = (1LL << 62) - 1;
const int inf = (1 << 30) - 1;

struct IoSetup {
  IoSetup() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
    cerr << fixed << setprecision(10);
  }
} iosetup;


template< typename T1, typename T2 >
ostream &operator<<(ostream &os, const pair< T1, T2 > &p) {
  os << p.first << " " << p.second;
  return os;
}

template< typename T1, typename T2 >
istream &operator>>(istream &is, pair< T1, T2 > &p) {
  is >> p.first >> p.second;
  return is;
}

template< typename T >
ostream &operator<<(ostream &os, const vector< T > &v) {
  for(int i = 0; i < (int) v.size(); i++) {
    os << v[i] << (i + 1 != v.size() ? " " : "");
  }
  return os;
}

template< typename T >
istream &operator>>(istream &is, vector< T > &v) {
  for(T &in : v) is >> in;
  return is;
}

template< typename T1, typename T2 >
inline bool chmax(T1 &a, T2 b) { return a < b && (a = b, true); }

template< typename T1, typename T2 >
inline bool chmin(T1 &a, T2 b) { return a > b && (a = b, true); }

template< typename T = int64 >
vector< T > make_v(size_t a) {
  return vector< T >(a);
}

template< typename T, typename... Ts >
auto make_v(size_t a, Ts... ts) {
  return vector< decltype(make_v< T >(ts...)) >(a, make_v< T >(ts...));
}

template< typename T, typename V >
typename enable_if< is_class< T >::value == 0 >::type fill_v(T &t, const V &v) {
  t = v;
}

template< typename T, typename V >
typename enable_if< is_class< T >::value != 0 >::type fill_v(T &t, const V &v) {
  for(auto &e : t) fill_v(e, v);
}

template< typename F >
struct FixPoint : F {
  FixPoint(F &&f) : F(forward< F >(f)) {}

  template< typename... Args >
  decltype(auto) operator()(Args &&... args) const {
    return F::operator()(*this, forward< Args >(args)...);
  }
};

template< typename F >
inline decltype(auto) MFP(F &&f) {
  return FixPoint< F >{forward< F >(f)};
}

template< typename OperatorMonoid >
struct DualSegmentTree {
  using H = function< OperatorMonoid(OperatorMonoid, OperatorMonoid) >;

  int sz, height;
  vector< OperatorMonoid > lazy;
  const H h;
  const OperatorMonoid OM0;


  DualSegmentTree(int n, const H h, const OperatorMonoid OM0)
      : h(h), OM0(OM0) {
    sz = 1;
    height = 0;
    while(sz < n) sz <<= 1, height++;
    lazy.assign(2 * sz, OM0);
  }

  inline void propagate(int k) {
    if(lazy[k] != OM0) {
      lazy[2 * k + 0] = h(lazy[2 * k + 0], lazy[k]);
      lazy[2 * k + 1] = h(lazy[2 * k + 1], lazy[k]);
      lazy[k] = OM0;
    }
  }

  inline void thrust(int k) {
    for(int i = height; i > 0; i--) propagate(k >> i);
  }

  void update(int a, int b, const OperatorMonoid &x) {
    thrust(a += sz);
    thrust(b += sz - 1);
    for(int l = a, r = b + 1; l < r; l >>= 1, r >>= 1) {
      if(l & 1) lazy[l] = h(lazy[l], x), ++l;
      if(r & 1) --r, lazy[r] = h(lazy[r], x);
    }
  }

  OperatorMonoid operator[](int k) {
    thrust(k += sz);
    return lazy[k];
  }
};

int main() {
  int64 N, M, X, Y;
  cin >> N >> M >> X >> Y;
  Y += X;
  vector< int > L(M), R(M), C(M);
  {
    vector< tuple< int, int, int > > d(M);
    for(int i = 0; i < M; i++) {
      int c, l, r;
      cin >> c >> l >> r;
      --l, --c;
      d[i] = tie(r, l, c);
    }
    sort(begin(d), end(d));
    for(int i = 0; i < M; i++) {
      tie(R[i], L[i], C[i]) = d[i];
    }
  }

  vector< int > xs(L);
  for(int i = 0; i < M; i++) xs.emplace_back(R[i]);
  sort(begin(xs), end(xs));
  xs.erase(unique(begin(xs), end(xs)), end(xs));
  for(int i = 0; i < M; i++) {
    L[i] = lower_bound(begin(xs), end(xs), L[i]) - begin(xs);
    R[i] = lower_bound(begin(xs), end(xs), R[i]) - begin(xs);
  }
  auto f = [](int64 a, int64 b) { return max(a, b); };
  using Seg = DualSegmentTree< int64 >;
  vector< Seg > segs1(3, Seg(xs.size(), f, -infll));
  vector< Seg > segs2(3, Seg(xs.size(), f, -infll));
  Seg seg(xs.size(), f, 0);


  vector< int64 > dp(M);
  for(int i = 0; i < M; i++) {
    chmax(dp[i], max(0LL, seg[L[i]] + (xs[R[i]] - xs[L[i]]) * X));
    for(int j = 0; j < 3; j++) {
      if(C[i] == j) chmax(dp[i], segs1[j][L[i]] + xs[R[i]] * X);
      else chmax(dp[i], segs2[j][L[i]] + xs[R[i]] * X + xs[L[i]] * Y);
    }
    seg.update(R[i], xs.size(), dp[i]);
    segs1[C[i]].update(L[i], R[i], dp[i] - xs[R[i]] * X);
    segs2[C[i]].update(L[i], R[i], dp[i] - xs[R[i]] * (X + Y));
  }

  cout << *max_element(begin(dp), end(dp)) << endl;
}


Measured memory_bytes: 66588