#include <bits/stdc++.h>
using namespace std;
long long v[5001], w[5001];
long long dp[5001][10001];
int main()
{

freopen("rucsac.in", "r", stdin);
freopen("rucsac.out", "w", stdout);
int n, W;
cin >> n >> W;
for(int i = 1; i <= n ; i++) {
	cin >> v[i] >> w[i];
}
for(int i = 1; i <= n; i++) {
	for(int j = 0; j <= W; j++) {
		dp[i][j] = dp[i - 1][j];
		dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - v[i]] + w[i]);
	}
}
cout << dp[n][W];

	return 0;

}