#include<bits/stdc++.h>
using namespace std;
ifstream fin("rucsac.in");
ofstream fout("rucsac.out");

int n, g, ans, i, j;
vector<int> weight, profit;
vector<vector<int>> dp;

int main()
{
    fin>> n>> g;
    dp.assign(n+1, vector<int>(g+1, -1));
    weight.resize(n+1);
    profit.resize(n+1);

    for(i = 1; i <= n; i++)
        fin>> weight[i]>> profit[i];

    dp[0][0] = 0;
    for(i = 1; i <= n; i++)
    {
        for(j = 0; j <= g; j++)
        {
            if(dp[i-1][j] >= 0)
                dp[i][j] = dp[i-1][j];
            if(j >= weight[i] && dp[i-1][j-weight[i]] >= 0 && dp[i-1][j-weight[i]] + profit[i] > dp[i][j])
                dp[i][j] = dp[i-1][j-weight[i]] + profit[i];
        }
    }

    for(i = 1; i <= g; i++)
        ans = max(ans, dp[n][i]);

    fout<< ans;

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