#include<bits/stdc++.h>
using namespace std;
int w[300005],v[300005];
long long dp[20005][20005];
int main()
{
	freopen("bag.in","r",stdin);
	freopen("bag.out","w",stdout);
    int n,m;
    scanf("%d%d",&n,&m);
    for(int i=1;i<=n;i++)
    {
        cin>>w[i]>>v[i];
    }
    for(int i=1;i<=n;i++) 
    {
    	for(int j=m;j>=0;j--)  
        {
            if(j>=w[i])
            {
                dp[i][j]=max(dp[i-1][j-w[i]]+v[i],dp[i-1][j]);
            }  
            else
            {
                dp[i][j]=dp[i-1][j];
            }              
        }
	}
    printf("%d",dp[n][m]);
    return 0;
}