#include<bits/stdc++.h>
using namespace std;
int n,m;
const int maxN=5000;
const int maxG=10005;
pair<int,int> v[maxN];
long long dp[maxG];
int g;
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",&v[i].first,&v[i].second);

    for(int i=1;i<=n;i++)
    {
        for(int j=g-v[i].first;j>=0;j--)
            dp[j+v[i].first]=max(dp[j+v[i].first],dp[j]+1LL*v[i].second);
    }

    long long sol=0;
    for(int i=0;i<=g;i++)
        sol=max(sol,dp[i]);

    printf("%lld\n",sol);
    return 0;
}