#include <iostream>
#include <vector>
#include <iomanip>
#include <algorithm>
#include <map>
#include <cmath>
#include <bitset>
#include <string>
using namespace std;

int main(){
    int n,I;cin >> n >> I;
    vector<int> s(n),a(n);
    for(int i=0;i<n;i++) cin >> s[i] >> a[i];
    vector dp(n+1,vector(I+1,-1));

    dp[0][0] = 0;
    for(int i=0;i<n;i++){
        for(int j=0;j<=I;j++){
            if(dp[i][j]!=-1){
                dp[i+1][j] = max(dp[i+1][j],dp[i][j]);  
                if(j+s[i]<=I) dp[i+1][j+s[i]] = max(dp[i+1][j+s[i]],dp[i][j]+a[i]);
            }
        }
    }

    int ans = 0;
    for(int i=0;i<=I;i++) ans = max(ans,dp[n][i]);
    cout << ans << endl;
}