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)
for i in range(1, w + 1):
    DP[n][i] = max(DP[n][i], DP[n][i - 1])
for i in range(1, w + 1):
    print(DP[n][w] - DP[n][w - i] + 1)