#include <bits/stdc++.h>
typedef long long ll;
using namespace std;

vector<ll> table;

int main() {
    ll N, K; cin >> N >> K;
    table.resize(2 * N+1, 0);
    ll l = max(K + 2, 2ll), r = min(K + 2 * N, 2 * N);

    for (ll i = 2; i <= 2 * N; i++) {
        // a + b = iになる組み合わせ数をtableに格納する
        ll cnt = 0;
        cnt += min(N, i-1) - max(1ll, i - N) + 1;
        //cout << "i: " << i << " cnt: " << cnt << endl;
        table[i] = cnt;
    }

    ll cnt = 0;
    for (ll i = l; i <= r; i++) {
        cnt += table[i] * table[i - K];
    }
    cout << cnt << endl;
}
#include<bits/stdc++.h>
using namespace std;
#define ALL(x) begin(x),end(x)
#define rep(i,n) for(int i=0;i<(n);i++)
#define debug(v) cout<<#v<<":";for(auto x:v){cout<<x<<' ';}cout<<endl;
#define mod 1000000007
using ll=long long;
const int INF=1000000000;
const ll LINF=1001002003004005006ll;
int dx[]={1,0,-1,0},dy[]={0,1,0,-1};
// ll gcd(ll a,ll b){return b?gcd(b,a%b):a;}
template<class T>bool chmax(T &a,const T &b){if(a<b){a=b;return true;}return false;}
template<class T>bool chmin(T &a,const T &b){if(b<a){a=b;return true;}return false;}

struct IOSetup{
    IOSetup(){
        cin.tie(0);
        ios::sync_with_stdio(0);
        cout<<fixed<<setprecision(12);
    }
} iosetup;
 
template<typename T>
ostream &operator<<(ostream &os,const vector<T>&v){
    for(int i=0;i<(int)v.size();i++) os<<v[i]<<(i+1==(int)v.size()?"":" ");
    return os;
}
template<typename T>
istream &operator>>(istream &is,vector<T>&v){
    for(T &x:v)is>>x;
    return is;
}

template<typename Monoid>
struct SegmentTree{
    int sz;
    vector<Monoid> seg;
    Monoid M0;// モノイドの元
    using F=function<Monoid(Monoid,Monoid)>;
    F f;
    SegmentTree(int n,Monoid M0,F f):M0(M0),f(f){
        sz=1;
        while(sz<n)sz<<=1;
        seg.assign(2*sz,M0);
    }
    void set(int k,Monoid x){
        seg[k+sz]=x;
    }
    void build(){
        for(int k=sz-1;k>0;k--) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    void update(int k,Monoid x){
        k+=sz;
        seg[k]=x;
        k>>=1;
        for(;k;k>>=1) seg[k]=f(seg[2*k],seg[2*k+1]);
    }
    Monoid query(int a,int b,int k=1,int l=0,int r=-1){
        if(r==-1) r=sz;
        if(a<=l and r<=b)   return seg[k];
        if(b<=l or r<=a)    return M0;
        Monoid L=query(a,b,2*k,l,(l+r)/2);
        Monoid R=query(a,b,2*k+1,(l+r)/2,r);
        return f(L,R);
    }
};

signed main(){
    int n;cin>>n;
    vector<int> a(n);
    cin>>a;
    SegmentTree<ll> seg(n,0ll,[](ll a,ll b){return a+b;});
    ll inv=0;
    vector<int> v(n,0);
    rep(i,n){
        ll x=seg.query(a[i],n);
        v[i]=x;
        inv+=x;
        seg.update(a[i],1);
    }

    cout<<inv<<endl;
    rep(i,n-1){
        inv+=n-a[i]-1;
        inv-=a[i];
        cout<<inv<<endl;
    }
    return 0;
}
