/**
 *   @FileName	f.cpp
 *   @Author	kanpurin
 *   @Created	2020.05.13 18:51:39
**/
#include "bits/stdc++.h" 
using namespace std; 
typedef long long ll;

struct Hoge {
    int x,v,w;
    Hoge(int x = 0,int v = 0,int w = 0) : x(x),v(v),w(w){}
};

int main() {
    int n, v, l;
    cin >> n >> v >> l;
    constexpr long long LLINF = 1e18 + 1;
    vector< vector< ll > > dp(n + 1, vector< ll >(v + 1, LLINF));
    dp[0][v] = 0;
    vector<Hoge> hg(n+1);
    hg[0] = Hoge(0,0,0);
    for (int i = 0; i < n; i++) {
        cin >> hg[i + 1].x >> hg[i + 1].v >> hg[i + 1].w;
        for (int j = 0; j <= v; j++) {
            if (hg[i + 1].x-hg[i].x > j) continue;
            dp[i + 1][j-(hg[i + 1].x-hg[i].x)+hg[i + 1].v] = min(dp[i + 1][j-(hg[i + 1].x-hg[i].x)+hg[i + 1].v],dp[i][j]+hg[i + 1].w);
            dp[i + 1][j-(hg[i + 1].x-hg[i].x)] = min(dp[i + 1][j-(hg[i + 1].x-hg[i].x)],dp[i][j]);
        }
    }
    ll ans = LLINF;
    for (int i = l - hg[n].x; i <= v; i++) {
        ans = min(dp[n][i],ans);
    }
    //cout << dp << endl;
    if (ans == LLINF) {
        cout << -1 << endl;
    }
    else {
        cout << ans << endl;
    }
    return 0;
}