M=lambda:map(int,input().split())
n,m=M()
a=sorted(list(M()))[::-1]
D,w,v=[[0]*(m+1)for _ in range(n+1)],[a[i]-a[i+1]for i in range(n-1)],[a[i]for i in range(n-1)]
for i in range(n):
 for j in range(m+1):
  if i<n-1 and j+w[i]<=m:D[i+2][j+w[i]]=D[i][j]+v[i]
  D[i+1][j]=max(D[i+1][j],D[i][j])
print(max(D[n]))