#include <iostream>
#include <vector>
#include <algorithm>
#include <cmath>
#include <queue>
#include <string>
#include <map>
#include <set>
#include <stack>
#include <tuple>
#include <deque>
#include <array>
#include <numeric>
#include <bitset>
#include <iomanip>
#include <cassert>
#include <chrono>
#include <random>
#include <limits>
#include <iterator>
#include <functional>
#include <sstream>
#include <fstream>
#include <complex>
#include <cstring>
#include <unordered_map>
using namespace std;

using ll = long long;
using P = pair<int, int>;
constexpr int INF = 1001001001;
constexpr int mod = 1000000007;
// constexpr int mod = 998244353;

template<class T>
inline bool chmax(T& x, T y){
    if(x < y){
        x = y;
        return true;
    }
    return false;
}
template<class T>
inline bool chmin(T& x, T y){
    if(x > y){
        x = y;
        return true;
    }
    return false;
}

int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int N, V, L;
    cin >> N >> V >> L;
    vector<int> x(N), v(N), w(N);
    for(int i = 0; i < N; ++i)  cin >> x[i] >> v[i] >> w[i];
    if(x[0] > V){
        cout << -1 << endl;
        return 0;
    }
    
    constexpr ll inf = 1e+17;
    vector<vector<ll>> dp(N, vector<ll>(V + 1, inf));
    dp[0][V - x[0]] = 0;
    dp[0][min(V, V - x[0] + v[0])] = w[0];
    for(int i = 1; i < N; ++i){
        for(int j = 0; j <= V; ++j){
            if(dp[i - 1][j] == inf || j - (x[i] - x[i - 1]) < 0)    continue;
            chmin(dp[i][j - (x[i] - x[i - 1])], dp[i - 1][j]);
            chmin(dp[i][min(V, j - (x[i] - x[i - 1]) + v[i])], dp[i - 1][j] + w[i]);
        }
    }

    ll ans = inf;
    for(int i = 0; i <= V; ++i){
        if(dp[N - 1][i] == inf || i - (L - x[N - 1]) < 0)   continue;
        chmin(ans, dp[N - 1][i]);
    }
    if(ans == inf)  ans = -1;
    
    cout << ans << endl;
    
    return 0;
}