#include<fstream>
using namespace std;
int d[30001],n,ans=0,s,l,k;
int small(int a)
{
	int r;
	for(r=1;r<=n;r++)
	{
		if(d[r]<a) return d[r];
	}
}
int big(int a)
{
	int r;
	for(r=1;r<=n;r++)
	{
		if(d[r]>a) return d[r];
	}
}
int search(int t,int left,int right)
{
	int r;
	if(ans<t)
	{
		ans=t;
	}
	else
	{
		for(r=left;r<=right;r++)
		{
			s=small(d[left]);
			l=big(d[left]);
			if((l-s)<=k)
			{
				search(t+1,left,right+1);
			}
			else search(t,left+1,right+1);
			if(left==right&&left==n) break;
		}
	}
}
int main()
{
	ifstream fin("riverbed.in");
	ofstream fout("riverbed.out");
	int i;
	fin>>n>>k;
	for(i=1;i<=n;i++)
	{
		fin>>d[i];
	}
	search(0,1,2);
	fout<<ans;
	return 0;
}