from collections import deque
N,W=map(int,input().split())
present=[list(map(int,input().split())) for _ in range(N)]
dp=dict()
d=deque()
d.append(0)
dp[0]=0
A=W+5
#dp[i*A+j]:i番目の品物までで、重さjになる組み合わせの中での勝ちの総和の最大値
#配る
while d:
    n=d.popleft()
    i,j=divmod(n,A)
    if i==N:
        break
    now=dp.pop(n)#=dp[i*A+j]
    if (i+1)*A+j not in dp:
        dp[(i+1)*A+j]=0
        d.append((i+1)*A+j)
    if dp[(i+1)*A+j]<now:
        dp[(i+1)*A+j]=now
    w,v=present[i]
    if j+w<=W:
        if (i+1)*A+j+w not in dp:
            dp[(i+1)*A+j+w]=0
            d.append((i+1)*A+j+w)
        if dp[(i+1)*A+j+w]<now+v:
            dp[(i+1)*A+j+w]=now+v
ans=[]
for j in range(W+1):
    if j==0:
        ans.append(0)
    else:
        if N*A+j not in dp:
            ans.append(ans[-1])
        else:
            ans.append(max(dp[N*A+j],ans[-1]))
ans_now=ans[W]
for X in range(1,W+1):
    print(ans_now-(ans[W-X])+1)