#include <bits/stdc++.h>

using namespace std;
const int N = 1010;
int n, m, w[N], v[N], f[N];

int main() {
    cin >> 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 >= w[i]; j--)
            f[j] = max(f[j], f[j - w[i]] + v[i]);
    printf("%d", f[m]);
    return 0;
}