#include<bits/stdc++.h>
using namespace std;
long long n,m,c[500010];
pair<long long,long long> s[500010];
long long ans[500010];
inline long long lowbit(long long x)
{
	return x&(-x);
}
inline void update(long long i,long long j)
{
	while(i<=n)
		c[i]+=j,i+=lowbit(i);
	return;
}
inline long long query(long long i)
{
	long long res=0;
	while(i)
		res+=c[i],i-=lowbit(i);
	return res;
}
int main()
{
	long long i,pre;
	scanf("%lld %lld",&n,&m);
	for(i=1;i<=n;++i)
	{
		scanf("%lld",&s[i].first);
		s[i].second=i;
	}
	sort(s+1,s+n+1);
	for(i=1;i<=n;++i)
	{
		ans[s[i].second]=(i-1)*s[i].first-pre+query(s[i].second);
		pre+=s[i].first;
		update(s[i].second,1);
	}
	for(i=1;i<=n;++i)
	{
		if(ans[i]>m-2)
			printf("-1\n");
		else
			printf("%lld\n",ans[i]);
	}
	return 0;
}