#include<bits/stdc++.h>
#define maxN 10005
using namespace std;
int dp[maxN],w[maxN],p[maxN],n,g,sol;
int main()
{
    freopen("rucsac.in","r",stdin);
    freopen("rucsac.out","w",stdout);
    scanf("%d%d",&n,&g);
    for(int i=1;i<=n;i++)
    {
        scanf("%d%d",&w[i],&p[i]);
    }

    for(int j=1;j<=n;j++)
    {
        for(int i=g;i>=0;i--)
        if((i+w[j])<=g) dp[i+w[j]]=max(dp[i+w[j]],p[j]+dp[i]);
    }

    for(int i=g;i>=1;i--)
        sol=max(sol,dp[i]);

    printf("%d\n",sol);

    return 0;
}