#include<bits/stdc++.h>
using namespace std;
#define int long long
signed main() {
    int N,A,B;
    cin>>N>>A>>B;
    vector<int> Y(N+1,1e18), dp(N+1);
    Y[0] = -1e15;
    for(int i=0;i<N;i++){
    	int x,y,z;
    	cin>>x>>y>>z;
    	Y[i+1] = y;
    	if(y-x > A) continue;
    	int t = upper_bound(Y.begin(),Y.end(),x-B)-Y.begin();
    	t--;
    	dp[i+1] = max(dp[i],dp[t]+z);
    }
    cout<<dp[N]<<endl;
}