#include <bits/stdc++.h>
#define int long long
using namespace std;
const int N=2e5+5;
struct node{
	int num,id;
	node(){}
	node(int num,int id):num(num),id(id){}
	bool operator < (const node &nd)const{
		return num<nd.num;
	}
}q[N];
int a[N],s[N],awa[N];
int n,m,k;
bool check(int id,int x){
	int xb=upper_bound(q+1,q+n+1,node(a[id]+x,id))-q;
	int sum=n-xb+1,fl=(awa[id]<=xb-1&&awa[id]>=xb-m-1+sum);
	if(q[xb-1].num==a[id]) xb--,fl=0;
	if(sum>=m) return 0;
	if(sum==m-1) return ((k-x)+q[xb-1].num<=a[id]+x);
	return ((m-sum-1)*(a[id]+x+1)>=k-x+s[xb-1]-s[xb-m+sum-2-fl]-a[id]*fl);
}
bool cmp(node a,node b){
	return a.num<b.num;
}
signed main(){
	cin>>n>>m>>k;
	for(int i=1;i<=n;i++){
		scanf("%lld",a+i);
		q[i].id=i,q[i].num=a[i];
		k-=a[i];
	}
	sort(q+1,q+n+1,cmp);
	for(int i=1;i<=n;i++) awa[q[i].id]=i;
	q[n+1].num=1e18,q[n+1].id=n+1;
	for(int i=1;i<=n;i++) s[i]=s[i-1]+q[i].num;
	for(int i=1;i<=n;i++){
		int l=0,r=k;
		while(l<=r){
			int mid=l+r>>1;
			if(check(i,mid)) r=mid-1;
			else l=mid+1;
		}
		if(check(i,l)&&l<=k) printf("%lld ",l);
		else printf("-1 ");
	}
}