import std.conv, std.functional, std.range, std.stdio, std.string;
import std.algorithm, std.array, std.bigint, std.bitmanip, std.complex, std.container, std.math, std.mathspecial, std.numeric, std.regex, std.typecons;
import core.bitop;

class EOFException : Throwable { this() { super("EOF"); } }
string[] tokens;
string readToken() { for (; tokens.empty; ) { if (stdin.eof) { throw new EOFException; } tokens = readln.split; } auto token = tokens.front; tokens.popFront; return token; }
int readInt() { return readToken.to!int; }
long readLong() { return readToken.to!long; }
real readReal() { return readToken.to!real; }

bool chmin(T)(ref T t, in T f) { if (t > f) { t = f; return true; } else { return false; } }
bool chmax(T)(ref T t, in T f) { if (t < f) { t = f; return true; } else { return false; } }

int binarySearch(alias pred, T)(in T[] as) { int lo = -1, hi = cast(int)(as.length); for (; lo + 1 < hi; ) { const mid = (lo + hi) >> 1; (unaryFun!pred(as[mid]) ? hi : lo) = mid; } return hi; }
int lowerBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a >= val)); }
int upperBound(T)(in T[] as, T val) { return as.binarySearch!(a => (a > val)); }


enum INF = 10L^^18;

void main() {
  try {
    for (; ; ) {
      const N = readInt();
      const U = readInt();
      const L = readInt();
      auto X = new int[N + 2];
      auto V = new int[N + 2];
      auto W = new long[N + 2];
      foreach (i; 1 .. N + 1) {
        X[i] = readInt();
        V[i] = readInt();
        W[i] = readLong();
      }
      X[0] = 0;
      X[N + 1] = L;
      
      auto dp = new long[][](N + 2, U + 1);
      foreach (i; 0 .. N + 2) {
        dp[i][] = INF;
      }
      dp[0][U] = 0;
      foreach (i; 1 .. N + 2) {
        const dx = X[i] - X[i - 1];
        foreach (j; dx .. U + 1) {
          chmin(dp[i][j - dx], dp[i - 1][j]);
        }
        foreach_reverse (j; 0 .. U + 1) {
          chmin(dp[i][min(j + V[i], U)], dp[i][j] + W[i]);
        }
      }
      const ans = dp[N + 1].minElement;
      writeln((ans >= INF) ? -1 : ans);
    }
  } catch (EOFException e) {
  }
}