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

using namespace std;

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

    int N, G;
    fin >> N >> G;

    vector<int> dp(G + 1, 0);

    for (int i = 1; i <= N; i++)
    {
        int w, p;
        fin >> w >> p;

        for (int j = G; j >= w; j--)
        {
            if (dp[j] < dp[j - w] + p)
            {
                dp[j] = dp[j - w] + p;
            }
        }
    }

    fout << dp[G];

    fin.close();
    fout.close();
    return 0;
}