N, W = map(int, input().split())

inf = float('inf')

w, v = [], []
for _ in range(N):
    ww, vv = map(int, input().split())
    w.append(ww)
    v.append(vv)

# dp[i][j] [0:i]まで見て合計がjの時の価値の総和の最大値
dp = [[-inf]*(W+1) for _ in range(N+1)]
dp[0][0] = 0

for i in range(N):
    for j in range(W+1):
        if j+w[i] <= W:
            dp[i+1][j+w[i]] = max(dp[i+1][j+w[i]], dp[i][j] + v[i])
        dp[i+1][j] = max(dp[i+1][j], dp[i][j])

dp = dp[N]
m = [-inf]*(W+2)
for i in range(W+1):
    m[i+1] = max(m[i], dp[i])

for x in range(1, W+1):
    print(m[-1] - m[W-x+1] + 1)