#include <fstream>

using namespace std;

ifstream f("rucsac.in");
ofstream g("rucsac.out");

const int N = 5000;
int n, k, p[N], w[N], dp[2 * N + 1], ans;

int main(){
    f >> n >> k;
    for(int i = 0; i < n; i++)
        f >> w[i] >> p[i];

    f.close();
    for(int j = 1; j <= k; j++)
        dp[j] = -1;

    for(int i = 0; i < n; i++){
        for(int j = k - w[i]; j >= 0; j--){
            if(dp[j] != -1)
                dp[j + w[i]] = max(dp[j + w[i]], dp[j] + p[i]);
        }
    }

    for(int j = 1; j <= k; j++)
        ans = max(ans, dp[j]);

    g << ans;
    g.close();
}