#include <fstream>
#include <algorithm>
using namespace std;
ifstream fin ("rucsac.in");
ofstream fout ("rucsac.out");
int a[5005][10005], n, G;
int main()
{
    int i, j, g[5005], v[5005];
    fin>>n>>G;
    for(i=1;i<=n;i++)
    {
        fin>>g[i]>>v[i];
    }
    for(i=1;i<=n;i++)
    {
        for(j=1;j<=G;j++)
        {
            if(j>=g[i])
            {
                a[i][j]=max(a[i-1][j-g[i]]+v[i], a[i-1][j]);
            }
            else
            {
                a[i][j]=a[i-1][j];
            }
        }
    }
    fout<<a[n][G];
    fin.close();
    fout.close();
    return 0;
}