#include<bits/stdc++.h>
#define debug(x) cerr<<#x<<":"<<x<<'\n'
using namespace std;
using ll = long long;
using pii = pair <int,int>;
using pll = pair <ll,ll>;
const int N = 5e5 + 5, M = 998244353;
ll n, m, s[N], ans[N], c[N];
pll a[N];
int lowbit(int x)
{
    return x & (-x);
}
void add(int p,int x)
{
    for(;p<=n;p+=lowbit(p)) c[p] += x;
}
ll sum(int p)
{
    int res = 0;
    for(;p;p-=lowbit(p)) res += c[p];
    return res;
}
void solve()
{
    cin>>n>>m;
    for(int i=1;i<=n;i++) cin>>a[i].first, a[i].second = i;
    sort(a+1,a+n+1);
    for(int i=1;i<=n;i++) s[i] = s[i-1] + a[i].first;
    for(int i=1;i<=n;i++)
    {
        ll res = (ll)(i-1)*a[i].first-s[i-1]+sum(i);
        ans[a[i].second] = res;
        add(a[i].second,1);
    }
    for(int i=1;i<=n;i++) cout<<((ans[i]>m-2)?-1:ans[i])<<"\n";
}
int main(void)
{
    ios::sync_with_stdio(0);
    cin.tie(0), cout.tie(0);
    int T = 1;
    // cin >> T;
    while(T--) solve();
    return 0;
}