#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
constexpr int M=5e5+5;
int n,m,tr[M],ans[M];
pair<int,int>a[M];ll sum;
int read(){
	int x=0;char ch=getchar();
	while (!isdigit(ch)) ch=getchar();
	while (isdigit(ch)) x=x*10+ch-48,ch=getchar();
	return x;
}
void update(int x){while (x<=n) tr[x]++,x+=x&-x;} 
int query(int x){int ans=0;while (x) ans+=tr[x],x-=x&-x;return ans;}
int main(){
	n=read();m=read();
	for (int i=1;i<=n;i++) a[i]={read(),i};
	sort(a+1,a+n+1);
	for (int i=1;i<=n;i++){
		sum+=a[i].first; 
		ll tmp=a[i].first*i+query(a[i].second)-sum;
		ans[a[i].second]=tmp>=m-1?-1:tmp;
		update(a[i].second);
	}
	for (int i=1;i<=n;i++) printf("%d\n",ans[i]);
	return 0;
}