#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
using ll = long long;
int main()
{
    int n=getN(),k=getK();
    ll ans=0;
    priority_queue<int> bal,jobb;
    while(n--)
    {
        int x=Data();
        bal.push(x),jobb.push(-(x+k));
        int a=bal.top(),b=abs(jobb.top());
        if(a>b)
        {
            ans+=a-b;
            bal.pop(),jobb.pop();
            bal.push(b),jobb.push(-a);
        }
        Solution(ans);
    }
}