using System;
using static System.Console;
using System.Linq;
using System.Collections.Generic;

class Program
{
    static long NN => long.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 = 10;
            var f = 60;
            var a = new int[n];
            var b = new int[n];
            var c = new int[n];
            for (var i = 0; i < n; ++i)
            {
                a[i] = r.Next(f + 1);
                b[i] = r.Next(f + 1);
                c[i] = r.Next(f + 1);
            }
            // 愚直解
            var s1 = All(n, f, a, b, c);
            // 作成解
            var s2 = Jan(n, f, a, b, c);
            var flg = true;
            for (var i = 0; i < n; ++i) if (s1[i] != s2[i]) flg = false;
            if (!flg)
            {
                WriteLine(n + " " + f);
                // WriteLine(string.Join("\n", map.Select(m => string.Join(" ", m))));
                WriteLine(string.Join(" ", a));
                WriteLine(string.Join(" ", b));
                WriteLine(string.Join(" ", c));
                WriteLine(string.Join(" ", s1));
                WriteLine(string.Join(" ", s2));
                // WriteLine(s1);
                // WriteLine(s2);
                return;
            }
            ++count;
            if (count % 1000 == 0) WriteLine(count);
        }
    }
    static int[] All(int n, int f, int[] a, int[] b, int[] c)
    {
        var ans = new int[n];
        var dp = new bool[n * f + 1];
        dp[0] = true;
        for (var i = 0; i < n; ++i)
        {
            for (var j = dp.Length - 1; j >= 0; --j)
            {
                if (j + a[i] < dp.Length) dp[j + a[i]] |= dp[j];
                if (j + b[i] < dp.Length) dp[j + b[i]] |= dp[j];
                if (j + c[i] < dp.Length) dp[j + c[i]] |= dp[j];
            }
            // WriteLine(string.Join(" ", dp));
            ans[i] = dp.Count(f => f);
        }
        return ans;
    }
    static void Solve()
    {
        var p = NList;
        var (n, f) = (p[0], p[1]);
        var a = NList;
        var b = NList;
        var c = NList;
        // WriteLine(string.Join(" ", All(n, f, a, b, c)));
        WriteLine(string.Join("\n", Jan(n, f, a, b, c)));
    }
    static int[] Jan(int n, int f, int[] a, int[] b, int[] c)
    {
        var ans = new int[n];
        var dp = new bool[n * f + 1];
        dp[0] = true;
        var move = new HashSet<int>[f + 1];
        move[0] = new HashSet<int>();
        for (var i = 0; i < move.Length; ++i) move[i] = new HashSet<int>{ 0 };
        for (var i = 0; i < n; ++i)
        {
            var add = new HashSet<int>();
            foreach (var cur in move[a[i]]) if (!dp[cur + a[i]])
            {
                dp[cur + a[i]] = true;
                add.Add(cur + a[i]);
            }
            move[a[i]] = new HashSet<int>();
            foreach (var cur in move[b[i]]) if (!dp[cur + b[i]])
            {
                dp[cur + b[i]] = true;
                add.Add(cur + b[i]);
            }
            move[b[i]] = new HashSet<int>();
            foreach (var cur in move[c[i]]) if (!dp[cur + c[i]])
            {
                dp[cur + c[i]] = true;
                add.Add(cur + c[i]);
            }
            move[c[i]] = new HashSet<int>();
            foreach (var ai in add) for (var j = 1; j < move.Length; ++j) move[j].Add(ai);
            if (i == 0) ans[0] = add.Count + 1;
            else ans[i] = ans[i - 1] + add.Count;
        }
        return ans;
    }
}