#include #include typedef long long int ll; typedef long long int ull; #define MP make_pair using namespace std; using namespace atcoder; typedef pair P; // const ll MOD = 998244353; const ll MOD = 1000000007; // using mint = modint998244353; using mint = modint1000000007; const double pi = 3.1415926536; const int MAX = 2000003; long long fac[MAX], finv[MAX], inv[MAX]; template using min_priority_queue = priority_queue, greater>; void COMinit() { fac[0] = fac[1] = 1; finv[0] = finv[1] = 1; inv[1] = 1; for (int i = 2; i < MAX; i++){ fac[i] = fac[i - 1] * i % MOD; inv[i] = MOD - inv[MOD%i] * (MOD / i) % MOD; finv[i] = finv[i - 1] * inv[i] % MOD; } } // 二項係数計算 long long COM(int n, int k){ if (n < k) return 0; if (n < 0 || k < 0) return 0; return fac[n] * (finv[k] * finv[n - k] % MOD) % MOD; } ll gcd(ll x, ll y) { if (y == 0) return x; else if (y > x) { return gcd (y, x); } else return gcd(x % y, y); } ll lcm(ll x, ll y) { return x / gcd(x, y) * y; } ll my_sqrt(ll x) { ll m = 0; ll M = 3000000001; while (M - m > 1) { ll now = (M + m) / 2; if (now * now <= x) { m = now; } else { M = now; } } return m; } ll keta(ll n) { ll ret = 0; while (n) { n /= 10; ret++; } return ret; } ll ceil(ll n, ll m) { // n > 0, m > 0 ll ret = n / m; if (n % m) ret++; return ret; } ll pow_ll(ll x, ll n) { if (n == 0) return 1; if (n % 2) { return pow_ll(x, n - 1) * x; } else { ll tmp = pow_ll(x, n / 2); return tmp * tmp; } } ll dp[2002][2002]; ll INF = (ll)1e18; int main() { ll n, V, l; cin >> n >> V >> l; ll x[n + 2]; ll v[n + 2]; ll w[n + 2]; x[0] = 0; x[n + 1] = l; v[n + 1] = 0; w[n + 1] = 0; for (int i = 1; i <= n; i++) cin >> x[i] >> v[i] >> w[i]; for (int i = 0; i <= n + 1; i++) { for (int j = 0; j <= V; j++) { dp[i][j] = INF; } } dp[0][V] = 0; for (ll i = 0; i <= n; i++) { for (ll j = 0; j <= V; j++) { // cout << i << ' ' << j << ' ' << dp[i][j] << endl; ll gas = j - (x[i + 1] - x[i]); if (gas >= 0) dp[i + 1][gas] = min(dp[i + 1][gas], dp[i][j]); if (gas >= 0) dp[i + 1][min(gas + v[i + 1], V)] = min(dp[i + 1][min(gas + v[i + 1], V)], dp[i][j] + w[i + 1]); } } ll ans = INF; for (int i = 0; i <= V; i++) { ans = min(ans, dp[n + 1][i]); } if (ans == INF) { cout << -1 << endl; } else { cout << ans << endl; } return 0; }