#include <bits/stdc++.h>

using namespace std;

typedef pair<int, int> pii;
typedef long long ll;
const int N = 2000086, MOD = 1e9 + 7, INF = 0x3f3f3f3f;
ll res;
int n, m, cnt, w[N];

typedef array<int, 3> ay;
int k, ans[N];
int main() {
    cin >> n >> m >> k;
    priority_queue<ay , vector<ay>, greater<ay> > q;
    for (int i = 1; i < n + 1; i++) scanf("%d", w + i), q.push({(m + w[i] - 1) / w[i], i, 0});
    while (k--) {
        auto u = q.top(); q.pop();
        ans[u[1]]++;
        int i = u[1], c = (m + w[i] - 1) / w[i];
        q.push({u[0] + c, i, 0});
    }
    for (int i = 1; i < n + 1; i++) printf("%d ", ans[i]);
    return 0;
}