#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>


using namespace __gnu_pbds;
using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef pair<int, int> PII;
typedef double db;
typedef tree<int, null_type, less<int>,
		rb_tree_tag,
		tree_order_statistics_node_update> ordered_set;


int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int n, m;
	cin >> n >> m;
	LL s1 = 0;
	vector<PII> a(n);
	FOR (i, 0, n)
	{
		cin >> a[i].F;
		a[i].S = i;
	}
	sort(ALL(a));
	ordered_set s;
	VI ans(n);
	FOR (i, 0, n)
	{
		LL x = (LL)i * a[i].F - s1 + s.order_of_key(a[i].S);
		if (x > m - 2)
			ans[a[i].S] = -1;
		else
			ans[a[i].S] = x;
		s.insert(a[i].S);
		s1 += a[i].F;
	}
	FOR (i, 0, n)
		cout << ans[i] << '\n';
	
	return 0;
}