#include //#include using namespace std; //using namespace atcoder; //using mint = modint1000000007; //const int mod = 1000000007; //using mint = modint998244353; //const int mod = 998244353; const int INF = 1e9; //const long long LINF = 1e18; #define rep(i, n) for (int i = 0; i < (n); ++i) #define rep2(i,l,r)for(int i=(l);i<(r);++i) #define rrep(i, n) for (int i = (n-1); i >= 0; --i) #define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i) #define all(x) (x).begin(),(x).end() #define allR(x) (x).rbegin(),(x).rend() #define endl "\n" #define P pair template inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; } template inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; } int main() { ios::sync_with_stdio(false); cin.tie(nullptr); int n, l; cin >> n >> l; vector> dp(n + 1, vector(l + 1, -INF)); vectors(n), a(n); rep(i, n)cin >> s[i] >> a[i]; dp[0][0] = 0; rep(i, n) { rep(j, l + 1) { if (-INF == dp[i][j])continue; int nj = j + s[i]; if (nj <= l)chmax(dp[i + 1][nj], dp[i][j] + a[i]); chmax(dp[i + 1][j], dp[i][j]); } } int ans = 0; rep(i, l + 1) chmax(ans, dp[n][i]); cout << ans << endl; return 0; }