#include <bits/stdc++.h>

using namespace std;

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

int n,g;
int dp[2][10003];
int w[10003], p[10003];

int main()
{
    ///optimizare: doua randuri
    /// row[i%2]
    fin>>n>>g;
    for(int i=1; i<=n; i++)
    {
        fin>>w[i]>>p[i];
    }
    for(int i=1; i<=n; i++)
    {
        for(int j=0; j<=g; j++)
        {
            if (w[i]<=j) dp[i%2][j]=max(dp[(i-1)%2][j], dp[(i-1)%2][j-w[i]]+p[i]);
            else dp[i%2][j]=dp[(i-1)%2][j];
        }
    }
    fout<<dp[n%2][g];
    return 0;
}