#include<cstdio>
#include<cstdio>
#include<cmath>
#include<queue>
#include<stack>
#include<string>
#include<cstring>
#include<iostream>
#include<map>
#include<vector>
#include<algorithm>
#include<set>
#include<cmath>
#define pii pair<int,int> 
using namespace std;
const int N = 1e6+10;
int q[N],a[N],l[N],r[N],c[N],cc[N];
int main()
{
	int n,m;
	while(cin>>n>>m)
	{
		for(int i=1;i<=n;++i)l[i]=0,r[i]=n+1,c[i]=cc[i]=0;
		int top=0;
		for(int i=1;i<=n;++i)
		{
			cin>>a[i];
			while(top&&a[q[top]]<=a[i])top--;
			if(top)l[i]=q[top];
			q[++top]=i;
		}
		top=0;
		for(int i=n;i>=1;--i)
		{
			while(top&&a[q[top]]<a[i])top--;
			if(top)r[i]=q[top];
			q[++top]=i;
		}
		for(int i=1;i<=n;++i)
		{
			int mx=max(0,a[i]-m),ml=i-l[i],mr=r[i]-i,mq=ml+mr-1;
			if(mx>=mq)
			{
				c[i]+=ml;
				c[i+mr]-=ml;
			}
			else if(mx<=ml)
			{
				c[i]+=mx;
				cc[i+1]--;
				if(mr>mx)
				{
					cc[i+max(mx,1)]++;
				}
				else cc[i+mr]++,c[i+mr]-=mx-mr+1;
				
			}
			else
			{
				c[i]+=ml;
				cc[i+mx-ml+1]--;
				cc[i+mx]++;
			}
		}
		for(int i=1;i<=n;++i)
		{
			
			cc[i]+=cc[i-1];
			c[i]+=c[i-1]+cc[i];
			cout<<c[i]<<" ";
		}
		cout<<'\n';
	}

    return 0;
}