#include <bits/stdc++.h>
template<typename T1, typename T2>
inline bool cmx (T1& a, T2 b) {
  if (a < b) {
    a = b;
    return true;
  }
  return false;
}
int main() {
  std::cin.tie(0); std::cin.sync_with_stdio(false);
  size_t n, m; int a;
  std::cin >> n >> m >> a;
  std::vector<std::tuple<size_t, size_t, int>> itv;
  while (m--) {
    size_t l, r; int p;
    std::cin >> l >> r >> p;
    l--;
    itv.emplace_back(l, r, p);
  }
  std::sort(itv.begin(), itv.end());
  std::vector<long long> dp(n + 1, 0);
  std::vector<long long> cum(n + 1, 0);
  size_t now = 1;
  for (auto [l, r, p] : itv) {
    for (; now < l; now++) {
      cum[now] = std::max(cum[now - 1], dp[now]);
    }
    cmx(dp[r], dp[l] + p - a);
    if (l > 0) cmx(dp[r], cum[l - 1] + p - 2 * a);
  }
  for (; now < n; now++) {
    cum[now] = std::max(cum[now - 1], dp[now]);
  }
  dp[n]+=a;
  cum[n] = std::max(cum[n - 1], dp[n]);
  std::cout << cum[n] << std::endl;
  return 0;
}