def main():
    from sys import stdin, setrecursionlimit
    # setrecursionlimit(1000000)
    input = stdin.readline
    def iinput(): return int(input())
    def sinput(): return input().rstrip()
    def i0input(): return int(input()) - 1
    def linput(): return list(input().split())
    def liinput(): return list(map(int, input().split()))
    def miinput(): return map(int, input().split())
    def li0input(): return list(map(lambda x: int(x) - 1, input().split()))
    def mi0input(): return map(lambda x: int(x) - 1, input().split())
    INF = 1000000000000000000
    MOD = 1000000007

    # i番目の重みws[i], 価値vs[i]
    def solve(N, W, ws, vs):
        dp = [0] * (W+1)
        for i in range(N):
            # 価値v, 重さw
            v = vs[i]; w = ws[i]
            for j in range(W, w-1, -1):
                dp[j] = max(dp[j-w] + v, dp[j])
        return max(dp)

    N, W = miinput()
    vs = []
    ws = []

    for _ in [0] * N:
        w, v = miinput()
        vs.append(v)
        ws.append(w)
    
    print(solve(N, W, ws, vs))


main()