///by Saton.
#include<bits/stdc++.h>
#define PI acos(-1)
#define fi first
#define se second 
#define sz(a) ((int)a.size())
#define all(a) a.begin(), a.end()
#define int long long
#define ll __int128
#define DD double double
#define LD long double
#define rep(i,a,b) for(int i = (a);i <= (b);i ++)
#define lep(i,a,b) for(int i = (a);i >= (b);i --)
#define FLUSH fflush(stdout)
using namespace std;
typedef pair<int,int> PII;
const int N = 5e5 + 10,mod = 998244353;
int n,m,k;
int lowbit(int x) {
    return x & (-x);
}
int tr[N*4];
void add(int pos,int val) {
    while(pos<=n) tr[pos] += val,pos += lowbit(pos);
}
int query(int pos) {
    int res = 0;
    while(pos) res += tr[pos],pos -= lowbit(pos);
    return res;
}

void solve() {
    cin >> n >> m;
    vector<PII> a(n+1);
    vector<int> ans(n+1);
    rep(i,1,n) cin >> a[i].fi,a[i].se = i;
    sort(all(a));
    int sum = 0;
    rep(i,1,n) {
        int j = a[i].se;
        int t = query(j);
        add(j,1);
        t += a[i].fi*(i-1) - sum;
        if(t>m) t = -1;
        ans[j] = t;
        sum += a[i].fi;
    }
    
    rep(i,1,n) cout << ans[i] << '\n';
} 

signed main() {
    ios::sync_with_stdio(false), cin.tie(0), cout.tie(0);
    // int T;
    // cin >> T;
    // while(T --) {
    //     solve();
    // }
    solve();
       
    return 0;
}  
/*   /\_/\
*   (= ._.)
*   / >  \>
*/