#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
const ll N = 5e5 + 10;
pair<ll, ll> a[N];
ll dp[N];
ll ans[N];
ll sum[N];
ll st[N];
int n, m;
void add(int pos, int val){
  while(pos <= n){
    st[pos] += val;
    pos += pos & (-pos);
  }
}
ll get(int pos){
  ll z = 0;
  while(pos){
    z += st[pos];
    pos -= pos & (-pos);
  }
  return z;
}
int main(){
  cin >> n >> m;
  for(int i = 1; i <= n; ++i){
    cin >> a[i].first;
    a[i].second = i;
  }
  sort(a + 1, a + 1 + n);
  for(int i = 1; i <= n; ++i){
    sum[i] = sum[i - 1] + a[i].first;
  }
  for(int i = 1; i <= n; ++i){
    dp[i] = a[i].first * ll(i - 1) - sum[i - 1] + get(a[i].second);
    add(a[i].second, 1);
  }
  for(int i = 1; i <= n; ++i){
    if(dp[i] <= m){
      ans[a[i].second] = dp[i];
    }
    else{
      ans[a[i].second] = -1;
    }
  }
  for(int i = 1; i <= n; ++i){
    cout << ans[i] << '\n';
  }
}