import core.bitop, std.algorithm, std.ascii, std.bigint, std.conv, std.math,
    std.functional, std.numeric, std.range, std.stdio, std.string, std.random,
    std.typecons, std.container, std.format;

// dfmt off
T lread(T = long)(){return readln.chomp.to!T();}
T[] aryread(T = long)(){return readln.split.to!(T[])();}
void scan(TList...)(ref TList Args){auto line = readln.split();
foreach (i, T; TList){T val = line[i].to!(T);Args[i] = val;}}
alias sread = () => readln.chomp();enum MOD = 10 ^^ 9 + 7;
alias PQueue = BinaryHeap!(Array!long, "a<b");
// dfmt on

void main()
{
    long N, T;
    scan(N, T);
    auto dp = new long[][](N + 1, 3000 * 3);
    foreach (i; 0 .. N)
    {
        long A, B;
        scan(A, B);
        foreach (j; 0 .. T)
        {
            dp[i + 1][j] = dp[i + 1][j].max(dp[i][j]);
            dp[i + 1][j + A] = dp[i + 1][j + A].max(dp[i][j] + B);
        }
        dp[i + 1][T] = dp[i + 1][T].max(dp[i][T]);
    }
    writeln(dp[N].reduce!max());
}
