/**
 *    author:  otera    
**/
#include<iostream>
#include<string> 
#include<cstdio>
#include<cstring>
#include<vector>
#include<cmath>
#include<algorithm> 
#include<functional>
#include<iomanip>
#include<queue>
#include<deque>
#include<ciso646>
#include<random>
#include<map>
#include<set>
#include<complex>
#include<bitset>
#include<stack>
#include<unordered_map>
#include<utility>
#include<cassert>
using namespace std;

#define int long long
typedef long long ll;
typedef unsigned long long ul;
typedef unsigned int ui;
typedef long double ld;
const int inf=1e9+7;
const ll INF=1LL<<60 ;
const ll mod=1e9+7 ;
#define rep(i,n) for(int i=0;i<n;i++)
#define per(i,n) for(int i=n-1;i>=0;i--)
#define Rep(i,sta,n) for(int i=sta;i<n;i++)
#define rep1(i,n) for(int i=1;i<=n;i++)
#define per1(i,n) for(int i=n;i>=1;i--)
#define Rep1(i,sta,n) for(int i=sta;i<=n;i++)
typedef complex<ld> Point;
const ld eps = 1e-8;
const ld pi = acos(-1.0);
typedef pair<int, int> P;
typedef pair<ld, ld> LDP;
typedef pair<ll, ll> LP;
#define fr first
#define sc second
#define all(c) c.begin(),c.end()
#define pb push_back
#define debug(x)  cerr << #x << " = " << (x) << endl;
template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return 1; } return 0; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return 1; } return 0; }

void solve() {
	int n, V, L; cin >> n >> V >> L;
    vector<int> x(n + 2), v(n + 2), w(n + 2);
	x[0] = 0, x[n + 1] = L;
    rep(i, n) {
        cin >> x[i + 1] >> v[i + 1] >> w[i + 1];
    }
    static int dp[2020][2020];
	rep(i, 2020) {
		rep(j, 2020) {
			dp[i][j] = INF;
		}
	}
	dp[0][V] = 0;
	for(int i = 1; i <= n; ++ i) {
		for(int j = 0; j <= V; ++ j) {
			if(j - (x[i] - x[i - 1]) < 0) continue;
			chmin(dp[i][j - (x[i] - x[i - 1])], dp[i - 1][j]);
			int res = min(V, j - (x[i] - x[i - 1]) + v[i]);
			chmin(dp[i][res], dp[i - 1][j] + w[i]);
		}
	}
	int ans = INF;
	for(int j = 0; j <= V; ++ j) {
		if(j - (x[n + 1] - x[n]) >= 0) chmin(ans, dp[n][j]);
	}
	cout << (ans == INF ? -1 : ans) << endl;
}

signed main() {
	ios::sync_with_stdio(false);
	cin.tie(0);
	//cout << fixed << setprecision(10);
	//int t; cin >> t; rep(i, t)solve();
	//GCJ
	// int t; cin >> t;
	// rep(i, t) {
	// 	cout << "Case #" << i + 1 << ": ";
	// 	solve();
	// }
	solve();
    return 0;
}