n, w = map(int, input().split())
DP = [[-1 for _ in range(w + 1)] for _ in range(n + 1)]
DP[0][0] = 0
for i in range(n):
    ww, vv = map(int, input().split())
    for j in range(w + 1):
        if DP[i][j] != -1:
            DP[i + 1][j] = max(DP[i + 1][j], DP[i][j])
            if j + ww <= w:
                DP[i + 1][j + ww] = max(DP[i + 1][j + ww], DP[i][j] + vv)
max_v = 0
for i in range(w, -1, -1):
    if DP[n][i] != -1:
        max_v = DP[n][i] + 1
        break
ANS = []
res = 0
for i in range(w - 1, -1, -1):
    if DP[n][i] != -1:
        res = DP[n][i]
    ANS.append(max_v - res)
print(*ANS, sep='\n')