#include <iostream>
#include <cstring>
#include <algorithm>

using namespace std;

const int N = 1010;
int n , m;
int v[N] , w[N];
int dp[N][N];

int main(){
    scanf("%d%d", &n, &m);
    for(int i = 1 ; i <= n ; ++i) scanf("%d%d", &v[i], &w[i]);
    
    for(int i = 1 ; i <= n ; ++i){
        for(int  j = 0 ; j <= m ; ++j){
                dp[i][j] = max(dp[i][j] , dp[i][j - v[i]] + w[i]);
        }
    }
    printf("%d\n" , dp[n][m]);
    return 0;
}