#include <bits/stdc++.h>
#define REP(i, n) for(int i = 0;i < n;i++)
#define ll long long
using namespace std;
//typedef vector<unsigned int>vec;
//typedef vector<ll>vec;
//typedef vector<vec> mat;
typedef pair<int, int> P;
typedef pair<ll,ll> LP;
const int dx[8] = {1, 0, -1, 0, 1, -1, -1, 1};
const int dy[8] = {0, 1, 0, -1, 1, 1, -1, -1};
const int INF = 1000000000;
const ll LINF = 1000000000000000000;//1e18
const ll  MOD = 1000000007;
const double PI = acos(-1.0);
const double EPS = 1e-10;

template<class T> inline bool chmax(T& a, T b) { if (a < b) { a = b; return true; } return false; }
template<class T> inline bool chmin(T& a, T b) { if (a > b) { a = b; return true; } return false; }
//template<class T> inline void add(T &a, T b){a = ((a+b) % MOD + MOD) % MOD;};

void solve(){
    ll N, V, L;
    cin >> N >> V >> L;
    vector<ll> x(N + 2), v(N + 2), w(N + 2);
    x[N+1] = L;
    for(int i=1;i<=N;i++) cin >> x[i] >> v[i] >> w[i];
    vector<vector<ll>> dp(N+10, vector<ll>(V+10, LINF));
    dp[0][V] = 0;
    REP(i,N){
        REP(j,V+1){
            if(dp[i][j] == INF) continue;
            int curV = j - (x[i+1] - x[i]);
            if(curV < 0) continue;
            chmin(dp[i+1][curV], dp[i][j]);
            ll next = min(V, curV + v[i+1]);
            chmin(dp[i+1][next], dp[i][j] + w[i+1]);
        }
    }
    ll ans = LINF;
    for(int i=L-x[N];i<=V;i++) chmin(ans, dp[N][i]);
    if(ans == LINF) ans = -1;
    cout << ans << endl;
}

int main(){
    cin.tie(0);
    ios::sync_with_stdio(false);
    solve();
    // int T; cin >> T; REP(t,T) solve();
}