#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;

//template
#define rep(i,a,b) for(int i=(a);i<(b);i++)
#define ALL(v) (v).begin(),(v).end()
typedef long long int ll;
const int inf = 0x3fffffff; const ll INF = 0x1fffffffffffffff; const double eps=1e-12;
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;}
//end

ll dp[2010][2010];

int main(){
   int n,v,l; scanf("%d%d%d",&n,&v,&l);
   vector<int> x(n+1),y(n),z(n); x[n]=l;
   rep(i,0,n)scanf("%d%d%d",&x[i],&y[i],&z[i]);
   rep(i,0,2010)rep(j,0,2010)dp[i][j]=INF;
   if(v-x[0]>=0)dp[0][v-x[0]]=0; else{puts("-1"); return 0;}
   rep(i,0,n)rep(j,0,v+1)if(dp[i][j]!=INF){
      if(j-x[i+1]+x[i]>=0)chmin(dp[i+1][j-x[i+1]+x[i]],dp[i][j]);
      if(min(v,j+y[i])-x[i+1]+x[i]>=0)chmin(dp[i+1][min(v,j+y[i])-x[i+1]+x[i]],dp[i][j]+z[i]);
   }
   ll res=INF;
   rep(i,0,v+1)chmin(res,dp[n][i]);
   printf(res==INF?"-1\n":"%lld\n",res);
   return 0;
}