#include <bits/stdc++.h>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, maxG;
int greutate[5001];
int profit[5001];
int dp[5001][10000];


int main() {

    fin>>n>>maxG;
    for(int i = 1; i <= n; i++){
        fin>>greutate[i];
        fin>>profit[i];
    }

    for(int i = 1; i <= n; i++){
        for(int j = 1; j <= maxG; j++){
            if(greutate[i] > j)
                dp[i][j] = dp[i-1][j];
            else
                dp[i][j] = max(dp[i-1][j], dp[i-1][j - greutate[i]] + profit[i]);
        }
    }

    fout<<dp[n][maxG];


    return 0;
}