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();
    }
    static void Solve()
    {
        var c = NList;
        var (n, h, t) = (c[0], c[1], c[2]);
        var a = NList;
        WriteLine(string.Join(" ", Turns(n, h, t, a)));
    }
    static int[] Turns(int n, int h, int t, int[] a)
    {
        var b = new long[n];
        var x = 0;
        var ans = new int[n];
        while (x < t)
        {
            var count = long.MaxValue;
            for (var i = 0; i < n; ++i) count = Math.Min(count, (h - b[i] + a[i] - 1) / a[i]);
            var list = new List<(int id, long val)>();
            for (var i = 0; i < n; ++i)
            {
                b[i] += count * a[i];
                if (b[i] >= h)
                {
                    list.Add((i, b[i]));
                    b[i] = 0;
                }
            }
            list.Sort((l, r) =>
            {
                var d = r.val.CompareTo(l.val);
                if (d != 0) return d;
                return l.id.CompareTo(r.id);
            });
            foreach (var li in list)
            {
                if (x >= t) break;
                ++ans[li.id];
                ++x;
            }
        }
        return ans;
    }
}