from bisect import*
n,k,*x=map(int,open(0).read().split())
l=[[]]
r=[[]]
lm=[[]for _ in range(n)]
rm=[[]for _ in range(n)]
p=0
q=n-1
for i in range(n):
  if x[i]-x[p]<k:
    l[-1]+=i,
  else:
    l+=[i],
    p=i
  lm[i]=len(l),l[-1][0]
  j=n-1-i
  if x[q]-x[j]<k:
    r[-1]+=j,
  else:
    r+=[j],
    q=j
  rm[j]=len(r),r[-1][0]
ans=max(len(l),len(r))
for i in range(n):
  l,li=lm[i]
  j=bisect_right(x,x[li]+k)
  if j<n:
    r,ri=rm[j]
    ans=max(ans,l+r)
print(ans)