(n,m),*e=[[*map(int,s.split())]for s in open(0)]
def compare(l,r):
  c1,d1=l
  c2,d2=r
  return c1+2*c2<=c2+2*c1
def merge(L,R):
  ret=[]
  l=r=0
  while l<len(L) and r<len(R):
    if compare(L[l],R[r]):
      ret+=L[l],
      l+=1
    else:
      ret+=R[r],
      r+=1
  return ret+L[l:]+R[r:]
def MergeSort(L):
  n=len(L)//2
  if n:
    return merge(MergeSort(L[:n]),MergeSort(L[n:]))
  return L
ne=[]
sd=0
for c,d in e:
  if c==0:
    sd+=d
  else:
    ne+=(c,d),
ne=MergeSort(ne)
n=len(ne)
INF=1<<60
l=min(n,9)
dp=[[-INF]*(l+1)for _ in range(m+1)]
dp[m][0]=0
tw=[1]
for _ in range(l):
  tw+=tw[-1]*2,
for i in range(1,n+1):
  c,d=ne[i-1]
  ndp=[[-INF]*(i+1)for _ in range(m+1)]
  for k in range(i+1):  #何個使ったか
    if c*tw[k]>m:
      break
    for j in range(m+1):  #残りエネルギー
      if k<i:
        ndp[j][k]=max(ndp[j][k],dp[j][k])
      nj=j-c*tw[k]
      if nj>=0 and k+1<=i:
        ndp[nj][k+1]=max(ndp[nj][k+1],dp[j][k]+d)
  dp=[t[:]for t in ndp]
ans=0
for j in range(m+1):
  for k in range(l+1):
    ans=max(ans,dp[j][k])
print(ans+sd)