#include <iostream>
#include <fstream>
#include <stack>
#include <queue>
#include <cmath>
#include <algorithm>
#include <set>
#include <cstring>
#include <map>
#include <string>
#include <bitset>
#include <unordered_map>
#include <unordered_set>
#define oo 2000000000
#define MOD 123457
using namespace std;

ifstream fin("rucsac.in");
ofstream fout("rucsac.out");
int dp[2][10001], n, G,w[5001],p[5001];
int main()
{
    fin >> n >> G;
    for (int i = 1; i <= n; i++)
    {
        fin >> w[i] >> p[i];
    }
    int linie = 1;
    dp[0][w[1]] = p[1];
    for (int i = 2; i <= n; i++)
    {
        for (int j = 0; j <= G; j++)
        {
            if (j >= w[i])
            {
                dp[linie][j] = max(dp[1 - linie ][j], dp[1-linie][j - w[i]] + p[i]);
            }
            else
                dp[linie][j] = dp[1-linie][j];
        }
        linie = 1 - linie;
    }
    linie = 1 - linie;
    int mx = 0;
    for (int i = 0; i <= G; i++)
    {
        mx = max(mx, dp[linie][i]);
   }
    fout << mx;

    
    

}