#include<iostream>
#include<cstdio>
#include<cstdlib>
#include<cmath>
#include<cstring>
#include<algorithm>

using namespace std;

int N,K,D[30010],ans;

int maxlenght(int u)
{
	int re=2,mxx=D[u]>D[u+1]?D[u]:D[u+1],mnn=D[u]<D[u+1]?D[u]:D[u+1];
	if(mxx-mnn>K)
		return 1;
	for(int i=u+2;i<=N;i++)
		if(abs(D[i]-mxx)<=K&&abs(D[i]-mnn)<=K)
		{
			re++;
			mxx=max(mxx,D[i]);
			mnn=min(mnn,D[i]);
		}
		else
			break;
	return re;
}

int main()
{
	freopen("riverbed.in","r",stdin);
	freopen("riverbed.out","w",stdout);
	scanf("%d%d",&N,&K);
	for(int i=1;i<=N;i++)
		scanf("%d",&D[i]);
	for(int i=1;i<=N;i++)
	{
		int k=maxlenght(i);
		ans=max(k,ans);
	}
	printf("%d\n",ans);
	return 0;
}