#pragma GCC optimize("Ofast") #pragma GCC target("avx2") #define rd_init() char*rp=({char*mmap();mmap(0l,1l<<25,1,2,0,0ll);}) #define rd() ({int _v=0,_c;while(_c=*rp++-48,_c>=0)_v=_v*10+_c;_v;}) #define wt(v) ({unsigned _z=v;do*--wp=_z%10+48;while(_z/=10);}) #define rep(v,e) for(typeof(e)v=0;v>8|a[i]<<56; } } void sort(ulong*a,ulong*b,int n){ sort_aux(a,b,n); sort_aux(b,a,n); sort_aux(a,b,n); sort_aux(b,a,n); } char wbuf[1<<25]; int a[100000]; ulong b[100000]; int c[100000]; ulong d[100000]; int dn; int main(){ int n,h,t; { rd_init(); n=rd(); h=rd(); t=rd(); rep(i,n){ a[i]=rd(); b[i]=(ulong)~0/((h-1)/a[i]+1); } } { long jh=1l<<40; long jl=0; while(jl+1>1; long s=0; rep(i,n){ //s+=j/((h-1)/a[i]+1); s+=j*((__uint128_t)b[i]+1)>>64; } if(s<=t){ jl=j; }else{ jh=j; } } rep(i,n){ t-=c[i]=jl/((h-1)/a[i]+1); long e=(jl%((h-1)/a[i]+1)+1)*a[i]-h; if(e>=0){ d[dn++]=(long)i<<32|e; } } } sort(d,b,dn); rep(i,t){ c[(int)d[i]]+=1; } { char*wp=wbuf+sizeof wbuf; rrep(i,n){ *--wp=' '; wt(c[i]); } write(1,wp,wbuf+sizeof wbuf-wp); } _exit(0); }