#include <bits/stdc++.h>
using ll = long long;
using pii = std::pair<int, int>;
const int MAXN = 5e5+9;

int n, m;
pii a[MAXN];
ll pre[MAXN];
std::map<int, bool> mp;
ll ans[MAXN];
ll c[MAXN<<1];
int lowbit(int x){ return x&-x; }
void update(int x){
    for (int i=x; i<MAXN*2; i+=lowbit(i)) c[i] += 1;
}
ll query(int x){
    ll res = 0;
    for (int i=x; i; i-=lowbit(i)) res += c[i];
    return res;
}
int main(){
    scanf("%d%d", &n, &m);
    for (int i=1; i<=n; ++i) scanf("%d", &a[i].first), a[i].second = i;

    std::sort(a+1, a+n+1);
    for (int i=1; i<=n; ++i) pre[i] = pre[i-1]+a[i].first;

    for (int i=1; i<=n; ++i){
        // printf("--%d\n", i);
        ll res = 1ll*i*a[i].first-pre[i];
        res += query(a[i].second);
        // printf(">%lld\n", query(a[i].second));
        ans[a[i].second] = res>m ? -1 : res;
        update(a[i].second);
    }

    for (int i=1; i<=n; ++i) printf("%lld\n", ans[i]);

    return 0;
}