#include <bits/stdc++.h>
using namespace std;
 
ifstream f("rucsac.in");
ofstream g("rucsac.out");
 
int n, G, w[100], p[100], m[100][100];
 
int main()
{
    f >> n >> G;
    for(int i = 1; i <= n; ++i)
        f >> w[i] >> p[i];
 
    for(int i = 1; i <= n; ++i)
        for(int j = 0; j <= G; ++j)
    {
        m[i][j] = m[i - 1][j];
        if(j - w[i] >= 0) m[i][j] = max(m[i][j], m[i - 1][j - w[i]] + p[i]);
    }
 
    g << m[n][G] << '\n';
    return 0;
}