#include <bits/stdc++.h>
using namespace std;
long long INF = 1000000000000000;
int main(){
  int N, V, L;
  cin >> N >> V >> L;
  vector<int> x, v, w;
  x.push_back(0);
  v.push_back(0);
  w.push_back(0);
  for (int i = 0; i < N; i++){
    int X, V, W;
    cin >> X >> V >> W;
    if (X != 0 && X != L){
      x.push_back(X);
      v.push_back(V);
      w.push_back(W);
    }
  }
  x.push_back(L);
  v.push_back(0);
  w.push_back(0);
  int M = x.size();
  vector<vector<long long>> dp(M, vector<long long>(V + 1, INF));
  for (int i = 0; i <= V; i++){
    dp[0][i] = 0;
  }
  for (int i = 1; i < M; i++){
    //ガソリンスタンドiについて見る
    for (int j = 0; j <= V; j++){
      if (j <= V - (x[i] - x[i - 1])){
        dp[i][j] = dp[i - 1][j + (x[i] - x[i - 1])];
      }
    }
    if (i < M){
      for (int j = V; j >= 0; j--){
        dp[i][j] = min(dp[i][j], dp[i][max(j - v[i], 0)] + w[i]);
      }
    }
  }
  if (dp[M - 1][0] == INF){
    cout << -1 << endl;
  } else {
    cout << dp[M - 1][0] << endl;
  }
}