n,w = map(int, input().split())
weight,value = [],[]
dp = [[0 for i in range(w + 1)] for i in range(n + 1)]
for i in range(n):
  a,b = map(int, input().split())
  weight.append(a)
  value.append(b)
for i in range(n + 1):
  for j in range(w + 1):
    if i == 0 or j == 0:
      dp[i][j] = 0
    elif weight[i - 1] <= j:
      dp[i][j] = max(value[i - 1] + dp[i - 1][j - weight[i - 1]], dp[i - 1][j])
    else:
      dp[i][j] = dp[i - 1][j]
print(dp[n][w])