#include <bits/stdc++.h>
using namespace std;

random_device rnd;
mt19937 mt(rnd());


int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);

    long long N,H,T; cin >> N >> H >> T;
    vector<long long> A(N);
    for(auto &a : A) cin >> a;
    auto solve = [&]() -> void {
        vector<long long> B(N),C(N);
        long long add = 0;
        for(int t=0; t<T; t++){
            
            while(*max_element(B.begin(),B.end()) < H){add++; for(int i=0; i<N; i++) B.at(i) += A.at(i);}
            long long maxb = *max_element(B.begin(),B.end());
            if(t == T-1){
                for(auto b : B) cout << b << " ";
                cout << endl;
            }
            for(int i=0; i<N; i++) if(maxb == B.at(i)){C.at(i)++,B.at(i) = 0; break;}
        }
        cout << add << endl;
        for(auto c : C) cout << c << " "; cout << endl;
    };
    //solve();

    vector<long long> need(N);
    vector<pair<long long,int>> A2(N);
    for(int i=0; i<N; i++){
        long long a = A.at(i);
        long long v = (H+a-1)/a;
        need.at(i) = v; 
        A2.at(i) = {need.at(i)*a,-i};
    }
    sort(A2.begin(),A2.end());
    for(auto &[a,p] : A2) p = -p;

    long long low = 0,high = H*T+2;
    vector<long long> C(N),answer;
    while(high-low > 1){
        long long mid = (high+low)/2;
        long long sum = 0;
        vector<bool> Last(N);
        for(int i=0; i<N; i++){
            long long now = mid/need.at(i);
            sum += now,C.at(i) = now;
            if(now*need.at(i) == mid) Last.at(i) = true; 
        }

        if(sum >= T){
            if(sum-N <= T){
                answer = C;
                for(auto [ign,p] : A2){
                    if(sum == T) break;
                    if(Last.at(p)) sum--,answer.at(p)--;
                }
            }    
            high = mid;
        }
        else low = mid;
    }
    for(auto &a : answer) cout << a << " "; cout << "\n";
}