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

#define se second
#define fi first

const int N=1e6;
int v[N];
int w[N];
int tree[N];
int qz[N],gre[N],low[N];
vector<int> nums;
map<int,int> mp,mc;
int n,m;
    int cnt[N];
    pair<int, int> x[N], y[N];

void merge_sort(int l, int r) {
    if (l >= r) return;
    int m = (l + r) >> 1;
    merge_sort(l, m);
    merge_sort(m+1, r);
    int idl = l, idr = m + 1, idx = l;
    while (idl <= m) {
        while (idr <= r && x[idr].first < x[idl].first) {
            y[idx++] = x[idr];
            idr++;
        }
        cnt[x[idl].second] += idr - m - 1;
        y[idx++] = x[idl];
        idl++;
    }
    for (int i = l; i < idr; ++i) {
        x[i] = y[i];
    }
}

vector<int> countSmaller() 
{
    int n = nums.size();
    for (int i = 0; i < n; ++i) {
        x[i] = make_pair(nums[i], i);
    }
    memset(cnt, 0, sizeof cnt);
    merge_sort(0, n-1);
    vector<int> res(cnt, cnt+n);
    return res;
}

int main()
{
	cin>>n>>m;
	for(int i=1;i<=n;i++)
	{
		cin>>v[i];
		w[i]=v[i];
		nums.push_back(v[i]);
	}
	sort(w+1,w+1+n);

	reverse(nums.begin(),nums.end());
	countSmaller();
	for(int i=1;i<=n;i++)
	{
		mp[w[i]]=(w[i]*(i-1))-qz[i-1];
		qz[i]=qz[i-1]+w[i];
	}

	for(int i=1;i<=n;i++)
	{
		int num=mp[v[i]]+mc[v[i]]+cnt[n-i];
		if(num>=m-1) cout<<-1<<endl;
		else cout<<num<<endl;
		mc[v[i]]++;
	}

}

/*
24-11=13
! !
3 8 12 6 9 9
3 6 8 9 9 12
! ! !
3    +1
5+2  +1
6+3+1 +3
6+3+1 +4

*/