#include<iostream>
#include<cstdio>
#include<cstring>
#include<cstdlib>
#include<ctime>
#include<cmath>
#include<algorithm>
#include<queue>
using namespace std;
#define FILE "read"
#define MAXN 3000010
#define cmin(a,b) a=min(a,b)
#define cmax(a,b) a=max(a,b)
int n,k,ans,cur(1),a[MAXN],head[3],tail[3],q[3][MAXN];
inline int read(){
int x=0,f=1; char ch=getchar();
while(!isdigit(ch)) {if(ch=='-') f=-1; ch=getchar();}
while(isdigit(ch)) {x=x*10+ch-'0'; ch=getchar();}
return x*f;
}
int main(){
freopen(FILE".in","r",stdin);
freopen(FILE".out","w",stdout);
k=read(); n=read(); head[1]=head[2]=1;
for(int i=1;i<=n;++i) a[i]=read();
for(int i=1;i<=n;++i){
while(a[i]>a[q[1][tail[1]]]&&head[1]<=tail[1]) tail[1]--;
while(a[i]<a[q[2][tail[2]]]&&head[2]<=tail[2]) tail[2]--;
q[1][++tail[1]]=i;
q[2][++tail[2]]=i;
while(a[q[1][head[1]]]-a[q[2][head[2]]]>k){
if(cur==q[1][head[1]]&&head[1]<=tail[1]) ++head[1];
if(cur==q[2][head[2]]&&head[2]<=tail[2]) ++head[2];
++cur;
}
cmax(ans,i-cur+1);
}
printf("%d\n",ans);
return 0;
}