#include <bits/stdc++.h>

using namespace std;
const int N = 110;
const int INF = 0x3f3f3f3f;

int n, m;
int f[N];

int main() {
    //文件输入
    freopen("QiaHao_WQ_Max.in", "r", stdin);
    scanf("%d %d", &n, &m);

    memset(f, -INF, sizeof f);
    f[0] = 0;

    for (int i = 1; i <= n; i++) {
        int v, w;
        scanf("%d %d", &v, &w);
        for (int j = v; j <= m; j++)
            f[j] = max(f[j], f[j - v] + w);
    }
    printf("%d\n", f[m]);
    return 0;
}