#[allow(unused_imports)]
use std::cmp::{Ordering};

#[allow(unused_imports)]
use std::collections::{BTreeMap, BTreeSet, BinaryHeap, HashMap, HashSet, VecDeque};

#[allow(unused_imports)]
use std::io::{stdin, stdout, BufWriter, Write};

#[allow(unused_imports)]
use std::iter::FromIterator;

#[allow(unused_macros)]
macro_rules! min {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::min($x, min!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! max {
    ($x: expr) => ($x);
    ($x: expr, $($z: expr),+) => {{
        std::cmp::max($x, max!($($z),*))
    }}
}

#[allow(unused_macros)]
macro_rules! get { 
    ([$t: ty]) => { 
        { 
            let mut line = String::new(); 
            stdin().read_line(&mut line).unwrap(); 
            line.split_whitespace().map(|t|t.parse::<$t>().unwrap()).collect::<Vec<_>>()
        }
    };
    ([$t: ty];$n: expr) => {
        (0..$n).map(|_|get!([$t])).collect::<Vec<_>>()
    };
    ($t: ty) => {
        {
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            line.trim().parse::<$t>().unwrap()
        }
    };
    ($($t: ty),*) => {
        { 
            let mut line = String::new();
            stdin().read_line(&mut line).unwrap();
            let mut iter = line.split_whitespace();
            ($(iter.next().unwrap().parse::<$t>().unwrap(),)*)
        }
    };
    ($t: ty; $n: expr) => {
        (0..$n).map(|_|get!($t)).collect::<Vec<_>>()
    };
    ($($t: ty),*; $n: expr) => {
        (0..$n).map(|_|get!($($t),*)).collect::<Vec<_>>()
    };
}

#[allow(unused_macros)]
macro_rules! debug {
    ($($a:expr),*) => {
        #[cfg(debug_assertions)]
        writeln!(&mut std::io::stderr(), concat!("[DEBUG] ", $(stringify!($a), "={:?} "),*), $($a),*).unwrap();
    }
}

const BIG_STACK_SIZE: bool = true;

#[allow(dead_code)]
fn main() {
    use std::thread;
    if BIG_STACK_SIZE {
        thread::Builder::new()
            .stack_size(32 * 1024 * 1024)
            .name("solve".into())
            .spawn(solve)
            .unwrap()
            .join()
            .unwrap();
    } else {
        solve();
    }
}

fn solve() {
    let (n,t) = get!(usize, usize);
    let ab = get!(usize, usize; n);

    let mut dp = vec![vec![(0, (0, 0)); t]; n+1];
    for i in 0..n {
        for j in 0..t {
            dp[i+1][j] = if j >= ab[i].0 {
                if dp[i][j-ab[i].0].0 + ab[i].1 > dp[i][j].0 {
                    (dp[i][j-ab[i].0].0 + ab[i].1, (i, j-ab[i].0))
                } else {
                    (dp[i][j].0, (i, j))
                }
            } else {
                (dp[i][j].0, (i,j))
            }
        }
    }

    let mut set = BTreeSet::new();
    let mut i = n;
    let mut j = t-1;
    loop {
        if i == 0 && j == 0 {
            break;
        }
        if j > (dp[i][j].1).1 {
            set.insert(i);
        }
        let tmp  = dp[i][j].1;
        i = tmp.0;
        j = tmp.1;
    }

    let mut mx = 0;
    for i in 0..n {
        if set.contains(&(i+1)) {
            continue;
        }
        mx = max!(mx, ab[i].1);
    }
    println!("{}", mx + dp[n][t-1].0);
}


Measured memory_bytes: 274812