#pragma GCC optimize("Ofast")

#include<bits/stdc++.h>

#define all(s) s.begin(),s.end()
#define rc(x) return cout<<x<<endl,0
#define forn(i,n) for(int i=0;i<int(n);i++)
#define pb push_back
#define mp make_pair
#define fr first
#define sc second

typedef long long ll;
typedef long double ld;

const int nmax=1025;
const int mod=998244353;
const ll inf=0x3f3f3f3f3f3f3f3f;

using namespace std;

int dp[10003];

int main()
{
  ios_base::sync_with_stdio(0); cin.tie(0);
  freopen("rucsac.in","r",stdin);
  freopen("rucsac.out","w",stdout);
  int n,m;
  cin>>n>>m;
  int sol=0;
  for(int i=1;i<=n;i++)
  {
    int x,y;
    cin>>x>>y;
    for(int j=m-x;j>=0;j--)
    {
      dp[j+x]=max(dp[j+x],dp[j]+y);
      if(dp[j+x]>sol) sol=dp[j+x];
    }
  }
  cout<<sol;
}