using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;
class Program
{
    static int NN => int.Parse(ReadLine());
    static int[] NList => ReadLine().Split().Select(int.Parse).ToArray();
    static int[][] NArr(long n) => Enumerable.Repeat(0, (int)n).Select(_ => NList).ToArray();
    public static void Main()
    {
        Solve();
        // Test();
    }
    static void Test()
    {
        var r = new Random();
        var count = 0;
        while (true)
        {
            var n = 2;
            var t = r.Next(1, 20);
            var map = new int[n][];
            for (var i = 0; i < n; ++i) map[i] = new int[] { r.Next(1, 10), r.Next(1, 10) };
            // 愚直解
            var s1 = All(n, t, map);
            // 作成解
            var s2 = Gift(n, t, map);
            if (s1 != s2)
            {
                WriteLine(n + " " + t);
                WriteLine(string.Join("\n", map.Select(m => string.Join(" ", m))));
                WriteLine(s1);
                WriteLine(s2);
                return;
            }
            ++count;
            if (count % 1000 == 0) WriteLine(count);
        }
    }
    static string All(int n, int w, int[][] map)
    {
        var ans = new int[w];
        for (var x = 1; x <= w; ++x)
        {
            for (var v = 1; v <= 100; ++v)
            {
                var dp = Enumerable.Repeat(long.MinValue, w + 1).ToArray();
                var valid = new bool[w + 1];
                dp[0] = 0;
                dp[x] = v;
                valid[x] = true;
                for (var i = 0; i < n; ++i)
                {
                    var ndp = (long[]) dp.Clone();
                    var nv = (bool[]) valid.Clone();
                    for (var j = 0; j < w; ++j)
                    {
                        if (j + map[i][0] >= ndp.Length) break;
                        if (ndp[j + map[i][0]] <= dp[j] + map[i][1])
                        {
                            ndp[j + map[i][0]] = dp[j] + map[i][1];
                            nv[j + map[i][0]] = valid[j];
                        }
                    }
                    dp = ndp;
                    valid = nv;
                    // if (x == 4 && v == 1)
                    // {
                    //     WriteLine(string.Join(" ", dp));
                    //     WriteLine(string.Join(" ", valid.Select(f => f ? "Y" : "N")));
                    // }
                }
                for (var i = 1; i < dp.Length; ++i) dp[i] = Math.Max(dp[i], dp[i - 1]);
                var max = dp[w];
                var flg = false;
                for (var i = 0; i < dp.Length; ++i)
                {
                    if (dp[i] == max)
                    {
                        flg = valid[i];
                        break;
                    }
                }
                // if (x == 4 && v == 1) WriteLine(flg);
                if (flg)
                {
                    ans[x - 1] = v;
                    break;
                }
            }
        }
        return string.Join(" ", ans);
    }
    static void Solve()
    {
        var c = NList;
        var (n, w) = (c[0], c[1]);
        var map = NArr(n);
        // WriteLine(All(n, w, map));
        WriteLine(Gift(n, w, map));
    }
    static string Gift(int n, int w, int[][] map)
    {
        var INF = long.MinValue;
        var init = Enumerable.Repeat(INF, w + 1).ToArray();
        var dp = (long[]) init.Clone();
        dp[0] = 0;
        for (var i = 0; i < n; ++i)
        {
            var ndp = (long[]) dp.Clone();
            for (var j = 0; j < dp.Length; ++j)
            {
                if (j + map[i][0] >= ndp.Length) break;
                ndp[j + map[i][0]] = Math.Max(ndp[j + map[i][0]], dp[j] + map[i][1]);
            }
            dp = ndp;
            // WriteLine(string.Join(" ", dp));
        }
        for (var i = 1; i < dp.Length; ++i) dp[i] = Math.Max(dp[i], dp[i - 1]);
        var ans = new long[w];
        for (var i = 0; i < ans.Length; ++i) ans[i] = dp[w] - dp[w - i - 1] + 1;
        return string.Join("\n", ans);
    }
}