#include <iostream>
#include <fstream>
#include <algorithm>

using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

struct obiect {
    int g, v; // g-greutate, v-valoare
    float r;
}a[5001];

int n, gmax, dp[5001][10001];

bool cmp(obiect x, obiect y) {
    return x.r > y.r;
}

int main()
{
    fin >> n >> gmax;
    for (int i = 1; i <= n; i++) {
        fin >> a[i].g >> a[i].v;
        a[i].r = a[i].v / a[i].g;
    }
    sort(a + 1, a + n + 1, cmp);
    for (int i = 1; i <= n; i++)
        for (int j = 1; j <= gmax; j++)
            if (a[i].g <= j)
                dp[i][j] = max(dp[i - 1][j], dp[i - 1][j - a[i].g] + a[i].v);
            else dp[i][j] = dp[i - 1][j];
    fout << dp[n][gmax];
    return 0;
}