#include <fstream>
#include <cstdio>
#include <cstdlib>
#include <queue>   
#include <vector>  
using namespace std;
int main() 
{
    ifstream in ("riverbed.in");
    ofstream out ("riverbed.out");
    int n;
	int k;
	int maxn=0,minn=100000;
	int i,j;
	int deep[30001]={0};
	int tmp=0,ans=1;
	in>>n>>k;
	for(i=1;i<=n;i++)
		in>>deep[i];
	for(i=1;i<n;i++)
	{
		maxn=deep[i];minn=deep[i];
		tmp=1;
		for(j=i+1;j<=n;j++)
		{
			if(deep[j]>maxn)	maxn=deep[j];
			if(deep[j]<minn)	minn=deep[j];
			if(maxn-minn>k) 
			{
				break;
			}
			tmp++;
		}
		if(tmp>ans)  ans=tmp;
	}
	out<<ans<<endl;
    return 0;
}