/*
UID:cheepok
PID:riverbed
*/

#include<stdio.h>
#include<set>

using namespace std;

struct orz
{
	int x,y;
	bool operator <(const orz & other) const
	{
		if(x<other.x||(x==other.x&&y<other.y))
			return true;
		return false;
	}
};

multiset <orz> s;

multiset <orz> :: iterator it,it1;

int n,m,k,Max,ans,a[30001];

int max(int a,int b)
{
	return a>b?a:b;
}

int main()
{
	freopen("riverbed.in","r",stdin);
	freopen("riverbed.out","w",stdout);
	int i,j;orz tmp;
	scanf("%d%d",&n,&m);
	k=1;
	for(i=1;i<=n;i++)
	{
		scanf("%d",&a[i]);Max=0;
		tmp.x=a[i]+m;tmp.y=0;
		for(it=s.upper_bound(tmp);it!=s.end();it++)
		{
			Max=max(Max,(*it).y);
		}
		tmp.x=a[i]-m;tmp.y=0;
		it1=s.lower_bound(tmp);
		for(it=s.begin();it!=it1;it++)
		{
			Max=max(Max,(*it).y);
		}
		for(j=k;j<=Max;j++)
		{
			tmp.x=a[j];tmp.y=j;
			s.erase(tmp);
		}
		k=Max+1;
		tmp.x=a[i];tmp.y=i;
		s.insert(tmp);
		ans=max(ans,s.size());
	}
	printf("%d\n",ans);
	return 0;
}