#include<algorithm>
#include<iostream>
#include<cstdio>
using namespace std;
int N, M;            //N个物品，包的体积为M
int w[3505], d[3505];      //体积，价值
int result[13005] = {0};         //result[i]表示从从 某些物品 中取出体积为i的最大价值
int main()
{
	scanf("%d%d", &N, &M);
	for (int i = 1; i <= N; ++i)
		scanf("%d%d", &w[i], &d[i]);
	for (int i = 1; i <= N; ++i)            //从前i个物品取体积为j
		for (int j = M; j >= w[i]; --j)
			result[j] = max(result[j], result[j - w[i]] + d[i]);
	printf("%d\n", result[M]);
	return 0;
}