#include<stdio.h>
int n, m, v[4000], w[4000], f[4000][4000];//v是体积，w是价值
int max(int x, int y)
{
	if (x >= y)
	{
		return x;
	}
	return y;
}
int main()
{
	scanf("%d%d", &n, &m);
	for (int i = 1; i <= n; i++)
	{
		scanf("%d%d", &v[i], &w[i]);
	}
	memset(f[0], 0, sizeof(f[0]));
	for (int i = 1; i <= n; i++)
	{
		for(int j=0;j<=m;j++)
		{
			f[i][j] = f[i - 1][j];
			if (j >= v[i])
			{
				f[i][j] = max(f[i - 1][j], f[i - 1][j - v[i]] + w[i]);
			}
		}
	}
	printf("%d", f[n][m]);
	return 0;
}