#include <bits/stdc++.h>
#define endl '\n'
#define int ll
using ll = long long;
typedef unsigned long long ull;
using namespace std;
void GordenGhost();
#define lowbit(x) (x&(-x))
const int maxn = 5e5+7;
int tree[maxn];
void build(int x, int d) {
    while (x < maxn) {
        tree[x] += d;
        x += lowbit(x);
    }
}
ll sumx(int x) {
    ll sum = 0;
    while (x > 0) {
        sum += tree[x];
        x -= lowbit(x);
    }
    return sum;
}
signed main() {
#ifdef Gorden
    freopen("in.txt", "rt", stdin);
    freopen("out.txt", "wt", stdout);
#endif
    ios::sync_with_stdio(false);
    cin.tie(nullptr), cout.tie(nullptr);
    GordenGhost();
    return 0;
}
 
void GordenGhost() {
    ll n,m;
    cin>>n>>m;
    map<int,int>mp;
    map<int,ll>mop;
    vector<int>w(n+1);
    for (int i = 1; i <= n; ++i) cin>>w[i],mp[w[i]]++;
    auto beifen=w;
    auto v=w;
    sort(v.begin()+1,v.end());
    ll sum[n+1]={};
    for (int i = 1; i <= n; ++i) sum[i]=sum[i-1]+v[i];
    ll cnt=0,ans=0;
    vector<pair<int,int>>asas;
    for (auto [a,b] : mp) {
        cnt++;
        asas.push_back({a,cnt});
    }
    for (auto [a,b] : asas){
        mp[a] = b;
    }
    for (int i=1;i<=n;++i){
        w[i]=mp[w[i]];
    }
    vector<ll>ans66(n+1);
      for(int i=1;i<=n;++i)
    {
           mop[v[i]]=v[i]*(i-1)-sum[i-1];
    }
    for(int i=1;i<=n;++i) ans66[i]+=mop[beifen[i]];
    for (int i = 1; i <= n; ++i) {
        ans66[i]+= sumx(w[i]);
        build(w[i],1);
    }
    int m2=m-2;
    for(int i=1;i<=n;++i)
    {
        if(ans66[i]>m2)cout<<"-1\n";else cout<<ans66[i]<<'\n';
    }
}