#![allow(non_snake_case)]
#![allow(unused_imports)]
#![allow(unused_macros)]
#![allow(clippy::needless_range_loop)]
#![allow(clippy::comparison_chain)]
#![allow(clippy::nonminimal_bool)]
#![allow(clippy::neg_multiply)]
#![allow(dead_code)]
// use itertools::Itertools;
use std::cmp::Reverse;
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, VecDeque};
// use superslice::Ext;
// use bitset_fixed::BitSet;

use proconio::{
    input,
    marker::{Chars, Usize1},
};

#[derive(Default)]
struct Solver {}
impl Solver {
    // #[fastout]
    fn solve(&mut self) {
        input! {
            N: usize,
            W: usize,
            D: isize,
            TWV: [(usize, usize, isize); N]
        }

        let mut WV0 = vec![];
        let mut WV1 = vec![];
        for &(t, w, v) in TWV.iter() {
            if t == 0 {
                WV0.push((w, v));
            } else {
                WV1.push((w, v));
            }
        }
        let L0 = WV0.len();
        let L1 = WV1.len();
        let INF = 1_isize << 60;
        let mut dp0 = vec![vec![-INF; W + 1]; L0 + 1];
        let mut dp1 = vec![vec![-INF; W + 1]; L1 + 1];
        dp0[0][0] = 0;
        dp1[0][0] = 0;

        for i in 1..=L0 {
            let (w, v) = WV0[i - 1];
            for j in 0..=W {
                dp0[i][j] = max!(dp0[i][j], dp0[i - 1][j]);
                if j + w <= W {
                    dp0[i][j + w] = max!(dp0[i][j + w], dp0[i - 1][j] + v);
                }
            }
        }
        for i in 1..=L1 {
            let (w, v) = WV1[i - 1];
            for j in 0..=W {
                dp1[i][j] = max!(dp1[i][j], dp1[i - 1][j]);
                if j + w <= W {
                    dp1[i][j + w] = max!(dp1[i][j + w], dp1[i - 1][j] + v);
                }
            }
        }
        let mut ans = 0;
        for i in 0..=W {
            for j in 0..=W {
                if (i as isize - j as isize).abs() > D || i + j > W {
                    continue;
                }
                ans = max!(ans, dp0[L0][i] + dp1[L1][j]);
            }
        }
        println!("{}", ans);
    }
}

#[macro_export]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::max($x, max!($( $y ),+))
    }
}
#[macro_export]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $( $y: expr ),+) => {
        std::cmp::min($x, min!($( $y ),+))
    }
}

fn main() {
    std::thread::Builder::new()
        .stack_size(128 * 1024 * 1024)
        .spawn(|| Solver::default().solve())
        .unwrap()
        .join()
        .unwrap();
}