INF = 10 ** 16
MOD = 10 **9 + 7
import sys
sys.setrecursionlimit(100000000)
dy = (-1,0,1,0)
dx = (0,1,0,-1)
from  collections import deque
from math import factorial

def main():
    n,V,L = map(int,input().split())
    Gas = [(0,0,INF)] + [tuple(map(int,input().split())) for _ in range(n)] + [(L,0,INF)]
    
    dp = [[0] * (V + 1)] + [[INF] * (V + 1) for _ in range(n + 1)]
    for i in range(n + 1):
        before_x,before_v,before_w = Gas[i]
        x,v,w = Gas[i + 1]
        for j in range(V + 1):      
            if min(j + before_v,V) - x + before_x >= 0: 
                dp[i + 1][min(j + before_v,V) - x + before_x] = min(dp[i + 1][min(j + before_v,V) - x + before_x],dp[i][j] + before_w)
            if j - x + before_x >= 0:
                dp[i + 1][j - x + before_x] = min(dp[i + 1][j - x + before_x],dp[i][j])
    ans = min(dp[-1])
    print(ans if ans != INF else -1)            
if __name__=='__main__':
    main()