#include <bits/stdc++.h>
using namespace std;
typedef long long i64;
#define int i64
#define rg(t) for(int i=1;i<=t;i++){
#define rg_(i,t) for(int i=1;i<=t;i++){
#define rrg(t) for(int i=0;i<t;i++){
#define gr }
int max(int a,int b){if(a>b)return a;return b;}
int min(int a,int b){if(a<b)return a;return b;}
inline int rd(){
    int fl=1,ret=0;char ch=getchar();
    while(ch<'0'||ch>'9'){if(ch=='-')fl=-1;ch=getchar();}
    while(ch>='0'&&ch<='9')ret=(ret<<1)+(ret<<3)+(ch^48),ch=getchar();
    return ret*fl;
}
int n,m,bit[500005],s[500005];
struct re{int x,id;}rec[500005];
void add(int i,int v){for(;i<500005;i+=i&-i)bit[i]+=v;}
int sum(int i){int ret=0;for(;i;i-=i&-i)ret+=bit[i];return ret;}
bool cmp(const re&u,const re&v){
    if(u.x==v.x)return u.id<v.id;
    return u.x<v.x;
}
signed main(){
    n=rd(),m=rd();
    rg(n)rec[i].x=rd();rec[i].id=i;gr
    std::sort(rec+1,rec+1+n,cmp);
    for(int i=2;i<=n;i++){
        s[rec[i].id]=s[rec[i-1].id]+(i-1)*(rec[i].x-rec[i-1].x);
    }
    rg(n)s[rec[i].id]+=sum(rec[i].id);
        add(rec[i].id,1);gr
    rg(n)if(s[i]>m-2)puts("-1");else{
        printf("%lld\n",s[i]);
    }gr
    return 0;
}
/*
*/