import java.io.PrintWriter
import java.util.*
import kotlin.math.*

fun PrintWriter.solve() {
    val n = nextInt()
    val l = nextInt()
    val (s, a) = Array(n) { nextInt() to nextInt() }.unzip().toList().map { it.toTypedArray() }
    val dp = Array(n + 1) { IntArray(l + 1) { 0 } }
    for (i in 0 until n) {
        for (j in 0..l) {
            if (j >= s[i]) {
                dp[i + 1][j] = maxOf(dp[i + 1][j], dp[i][j], dp[i][j - s[i]] + a[i])
            } else {
                dp[i + 1][j] = maxOf(dp[i + 1][j], dp[i][j])
            }
        }
    }
    println(dp[n].maxOrNull())
}

fun main() {
    Thread(null, {
        val writer = PrintWriter(System.out, false)
        writer.solve()
        writer.flush()
    }, "solve", abs(1L.shl(26)))
        .apply { setUncaughtExceptionHandler { _, e -> e.printStackTrace(); kotlin.system.exitProcess(1) } }
        .apply { start() }.join()
}

// region Scanner
private var st = StringTokenizer("")
private val br = System.`in`.bufferedReader()

fun next(): String {
    while (!st.hasMoreTokens()) st = StringTokenizer(br.readLine())
    return st.nextToken()
}

fun nextInt() = next().toInt()
fun nextLong() = next().toLong()
fun nextLine() = br.readLine()
fun nextDouble() = next().toDouble()
// endregion