#include <bits/stdc++.h>
#include "grader.h"
using namespace std;
using ll = long long;
int main()
{
    int n = getN(), k = getK();
    map<int, ll> m;
    ll ans = 0;
    ll l = 0, r = k, ldb = 0, lb = 0, rdb = 0, rb = 0;
    for(int i = 1; i <= n; i++)
    {
        int x = Data();
        m[x]++;
        if(x < l)
        {
            ans += l - x;
            ldb++;
        }
        if(x == l) lb++;
        if(x > r)
        {
            ans += x - r;
            rdb++;
        }
        if(x == r) rb++;
        if(rdb > ldb + lb)
        {
            pair<int, int> it1 = *m.upper_bound(l), it2 = *m.upper_bound(r);
            int mov = min(it1.first - l, it2.first - r);
            l += mov;
            r += mov;
            ldb += lb;
            lb = 0;
            rb = 0;
            ans -= mov * (rdb - ldb);
            if(it1.first == l)
            {
                lb = it1.second;
            }
            if(it2.first == r)
            {
                rb = it2.second;
                rdb -= it2.second;
            }
        }
        if(ldb > rdb + rb)
        {
            auto x = m.lower_bound(l), y = m.lower_bound(r);
            x--;
            y--;
            pair<int, int> it1 = *x, it2 = *y;
            int mov = min(l - it1.first, r - it2.first);
            l -= mov;
            r -= mov;
            rdb += rb;
            lb = 0;
            rb = 0;
            ans -= mov * (ldb - rdb);
            if(l == it1.first)
            {
                lb = it1.second;
                ldb -= it1.second;
            }
            if(r == it2.first)
            {
                rb = it2.second;
            }
        }
        Solution(ans);
    }
    return 0;
}