#include <bits/stdc++.h>
using namespace std;
template <typename T, typename U>
std::istream& operator>>(std::istream& i, pair<T, U>& p) {
  i >> p.first >> p.second;
  return i;
}
template <typename T>
std::istream& operator>>(std::istream& i, vector<T>& t) {
  for (auto& v : t) {
    i >> v;
  }
  return i;
}
template <typename T, typename U>
std::ostream& operator<<(std::ostream& o, const pair<T, U>& p) {
  o << p.first << ' ' << p.second;
  return o;
}
template <typename T>
std::ostream& operator<<(std::ostream& o, const vector<T>& t) {
  if (t.empty()) o << '\n';
  for (size_t i = 0; i < t.size(); ++i) {
    o << t[i] << " \n"[i == t.size() - 1];
  }
  return o;
}
template <typename T>
using minheap = priority_queue<T, vector<T>, greater<T>>;
template <typename T>
using maxheap = priority_queue<T, vector<T>, less<T>>;
template <typename T>
bool in(T a, T b, T c) {
  return a <= b && b < c;
}
unsigned int logceil(long long first) {
  return first ? 8 * sizeof(long long) - __builtin_clzll(first) : 0;
}
namespace std {
template <typename T, typename U>
struct hash<pair<T, U>> {
  hash<T> t;
  hash<U> u;
  size_t operator()(const pair<T, U>& p) const {
    return t(p.first) ^ (u(p.second) << 7);
  }
};
}  // namespace std
template <typename T, typename F>
T bsh(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      l = m + 1;
      r = m;
    } else {
      h = m - 1;
    }
  }
  return r;
}
template <typename F>
double bshd(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      l = m;
    } else {
      h = m;
    }
  }
  return (l + h) / 2;
}
template <typename T, typename F>
T bsl(T l, T h, const F& f) {
  T r = -1, m;
  while (l <= h) {
    m = (l + h) / 2;
    if (f(m)) {
      h = m - 1;
      r = m;
    } else {
      l = m + 1;
    }
  }
  return r;
}
template <typename F>
double bsld(double l, double h, const F& f, double p = 1e-9) {
  unsigned int r = 3 + (unsigned int)log2((h - l) / p);
  while (r--) {
    double m = (l + h) / 2;
    if (f(m)) {
      h = m;
    } else {
      l = m;
    }
  }
  return (l + h) / 2;
}
template <typename T>
T gcd(T a, T b) {
  if (a < b) swap(a, b);
  return b ? gcd(b, a % b) : a;
}
template <typename T>
class vector2 : public vector<vector<T>> {
 public:
  vector2() {}
  vector2(size_t a, size_t b, T t = T())
      : vector<vector<T>>(a, vector<T>(b, t)) {}
};
template <typename T>
class vector3 : public vector<vector2<T>> {
 public:
  vector3() {}
  vector3(size_t a, size_t b, size_t c, T t = T())
      : vector<vector2<T>>(a, vector2<T>(b, c, t)) {}
};
template <typename T>
class vector4 : public vector<vector3<T>> {
 public:
  vector4() {}
  vector4(size_t a, size_t b, size_t c, size_t d, T t = T())
      : vector<vector3<T>>(a, vector3<T>(b, c, d, t)) {}
};
template <typename T>
class vector5 : public vector<vector4<T>> {
 public:
  vector5() {}
  vector5(size_t a, size_t b, size_t c, size_t d, size_t e, T t = T())
      : vector<vector4<T>>(a, vector4<T>(b, c, d, e, t)) {}
};
template <typename ValueType, typename TagType,
          void (*combineTag)(TagType&, TagType),
          void (*applyTag)(ValueType&, TagType, unsigned int),
          ValueType (*combineValues)(ValueType, ValueType)>
struct LSegTree {
  LSegTree(const vector<ValueType>& data, const ValueType& nullValue,
           const TagType& nullTag)
      : n(1 << logceil(data.size())),
        nullValue(nullValue),
        nullTag(nullTag),
        T(2 * n, {nullValue, nullTag}) {
    for (int i = 0; i < data.size(); ++i) T[n + i].first = data[i];
    for (unsigned int i = n - 1; i > 0; i--)
      T[i].first = combineValues(T[i << 1].first, T[i << 1 | 1].first);
  }
  LSegTree(unsigned int size, const ValueType& nullValue,
           const TagType& nullTag)
      : n(1 << logceil(size)),
        nullValue(nullValue),
        nullTag(nullTag),
        T(2 * n, {nullValue, nullTag}) {
    for (unsigned int i = n - 1; i > 0; i--)
      T[i].first = combineValues(T[i << 1].first, T[i << 1 | 1].first);
  }
  inline void put(unsigned int first, const TagType& n) {
    put(first, first, n);
  }
  inline void put(unsigned int from, unsigned int to, TagType v) {
    putInner(from, to, v, 1, n);
  }
  inline ValueType operator[](pair<unsigned int, unsigned int> first) {
    return get(first.first, first.second);
  }
  inline ValueType operator[](unsigned int first) { return get(first, first); }
  inline ValueType get(unsigned int first) const { return get(first, first); }
  inline ValueType get(unsigned int from, unsigned int to) {
    return getInner(from, to, 1, n);
  }
  void putInner(unsigned int from, unsigned int to, TagType v, unsigned int i,
                unsigned int s) {
    vector<int> Q;
    unsigned int r = i;
    while (true) {
      if (from == 0 && to == s - 1) {
        applyTag(T[i].first, v, s);
        combineTag(T[i].second, v);
        break;
      }
      pushTagDown(i, s);
      s >>= 1;
      i <<= 1;
      if (from & s) {
        from ^= s;
        to ^= s;
        i ^= 1;
      } else if (to & s) {
        putInner(0, to ^ s, v, i | 1, s);
        to = s - 1;
      }
    }
    while (i != r) {
      T[i >> 1].first = combineValues(T[i].first, T[i ^ 1].first);
      i >>= 1;
    }
  }
  ValueType getInner(unsigned int from, unsigned int to, unsigned int i,
                     unsigned int s) {
    while (true) {
      if (from == 0 && to == s - 1) {
        return T[i].first;
      }
      pushTagDown(i, s);
      s >>= 1;
      i <<= 1;
      if (to & s) {
        to ^= s;
        if (from & s) {
          from ^= s;
          i |= 1;
        } else {
          auto a = getInner(from, s - 1, i, s), b = getInner(0, to, i | 1, s);
          return combineValues(a, b);
        }
      }
    }
  }
  template <typename Pred>
  unsigned int binsearchLeft(Pred pred) {
    ValueType value = nullValue;
    return binsearchLeftInner(1, 0, n, value, pred);
  }
  template <typename Pred>
  unsigned int binsearchLeftInner(unsigned int i, unsigned int l,
                                  unsigned int r, ValueType& curValue,
                                  Pred pred) {
    if (l + 1 != r) pushTagDown(i, r - l);
    ValueType nextValue = combineValues(T[i].first, curValue);
    if (pred(nextValue)) {
      curValue = nextValue;
      return l;
    }
    if (l + 1 == r) return r;
    unsigned int s =
        binsearchLeftInner(i << 1 | 1, (l + r) / 2, r, curValue, pred);
    if (s == (l + r) / 2) {
      return binsearchLeftInner(i << 1, l, (l + r) / 2, curValue, pred);
    } else {
      return s;
    }
  }
  void pushTagDown(unsigned int i, unsigned int s) {
    applyTag(T[i << 1].first, T[i].second, s >> 1);
    applyTag(T[i << 1 | 1].first, T[i].second, s >> 1);
    combineTag(T[i << 1].second, T[i].second);
    combineTag(T[i << 1 | 1].second, T[i].second);
    T[i].second = nullTag;
  }
  unsigned int n;
  ValueType nullValue;
  TagType nullTag;
  vector<pair<ValueType, TagType>> T;
};
template <typename F>
void LAddOp(F& a, F b) {
  a += b;
}
template <typename F>
void LAddOp2(F& a, F b, unsigned int) {
  a += b;
}
template <typename F>
F LMinOp(F a, F b) {
  return std::min(a, b);
}
template <typename F>
F LMaxOp(F a, F b) {
  return std::max(a, b);
}
template <typename T>
T LSumOp(T a, T b) {
  return a + b;
}
template <typename T>
void LAssignOp(T& a, T b) {
  if (b != 0) a = b;
};
template <typename T>
void LAssignOp2(T& a, T b, unsigned int) {
  if (b != 0) a = b;
};
template <typename T>
void LAssignMultOp(T& a, T b, unsigned int s) {
  if (b != 0) a = b * s;
};
template <typename T>
using LAddMaxTree = LSegTree<T, T, LAddOp<T>, LAddOp2<T>, LMaxOp<T>>;
template <typename T>
using LAddMinTree = LSegTree<T, T, LAddOp<T>, LAddOp2<T>, LMinOp<T>>;
template <typename T>
using AssignSumTree = LSegTree<T, T, LAssignOp<T>, LAssignMultOp<T>, LSumOp<T>>;
template <typename T>
using AssignMaxTree = LSegTree<T, T, LAssignOp<T>, LAssignOp2<T>, LMaxOp<T>>;
class DKarenAndCards {
 public:
  void solve(istream& cin, ostream& cout) {
    long long N, P, Q, R;
    cin >> N >> P >> Q >> R;
    long long ans = P * Q * R;
    vector<vector<std::pair<int, int>>> C(P);
    for (int i = 0; i < N; ++i) {
      int a, b, c;
      cin >> a >> b >> c;
      C[a - 1].emplace_back(b - 1, c);
    }
    AssignSumTree<long long> SS{(unsigned int)Q, 0, 0};
    AssignMaxTree<int> ST{(unsigned int)Q, 0, 0};
    for (int p = 0; p < P; ++p) {
      for (std::pair<int, int> c : C[p]) {
        int ql = ST.binsearchLeft([c](int v) { return v < c.second; });
        if (ql <= c.first) {
          ST.put(ql, c.first, c.second);
          SS.put(ql, c.first, c.second);
        }
      }
    }
    for (int p = P - 1; p >= 0; --p) {
      for (std::pair<int, int> c : C[p]) {
        ST.put(0, c.first, R);
        SS.put(0, c.first, R);
        int ql = ST.binsearchLeft([c](int v) { return v < c.second; });
        if (ql <= Q - 1) {
          ST.put(ql, Q - 1, c.second);
          SS.put(ql, Q - 1, c.second);
        }
      }
      ans -= SS.get(0, Q - 1);
    }
    cout << ans << '\n';
  }
};
int main() {
  ios_base::sync_with_stdio(false);
  cin.tie(nullptr);
  cout.tie(nullptr);
  DKarenAndCards solver;
  std::istream& in(std::cin);
  std::ostream& out(std::cout);
  solver.solve(in, out);
  return 0;
}
