#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <map>
#include <stack>
using namespace std;

int arr[101][100001];

int main()
{
	ios_base::sync_with_stdio(false);
	cin.tie(NULL);
	cout.tie(NULL);

	//O(n*k) : 1천만
	int n, k;
	cin >> n >> k;
	for (int i = 1; i <= n; i++) {
		int w, v;
		cin >> w >> v;
		for (int j = 1; j <= k; j++) {
			if (j >= w) {
				//(현재꺼가치 + 넣고남는공간최대가치)와 기존가치를 비교
				if (v + arr[i-1][j-w] >= arr[i-1][j]) {
					arr[i][j] = v + arr[i - 1][j - w];
				}
				else {
					arr[i][j] = arr[i - 1][j];
				}
			}
			else {
				arr[i][j] = arr[i - 1][j];
			}
		}
	}

	cout << arr[n][k];

	return 0;
}