//未优化
#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 10010;
int n, m; //数量、容积
int v[N], w[N];
int f[N][N]; //[n][v]，第几件物品，有多少空间被占据

int main(){

    cin >> n >> m;

    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = 1; j <= m; j ++ ){

            f[i][j] = f[i - 1][j];
            if (j >= v[i]) f[i][j] = max (f[i][j], f[i - 1][j - v[i]] + w[i]);
        }

    cout << f[n][m];

    return 0;
}

//优化后
#include<iostream>
#include<cstring>
#include<algorithm>

using namespace std;

const int N = 10010;
int n, m; //数量、容积
int v[N], w[N];
int f[N]; //[n][v]，第几件物品，有多少空间被占据

int main(){

    cin >> n >> m;

    for (int i = 1; i <= n; i ++ ) cin >> v[i] >> w[i];

    for (int i = 1; i <= n; i ++ )
        for (int j = m; j >= v[i]; j -- ){

            f[j] = f[j];
            if (j >= v[i]) f[j] = max (f[j], f[j - v[i]] + w[i]);
        }

    cout << f[m];

    return 0;
}