n,k = map(int,input().split()) a = list(map(int,input().split())) a.sort() left = 0 max_length = 0 for right in range(len(a)): while a[right] - a[left] > k: left += 1 current_length = right - left + 1 max_length = max(max_length,current_length) print(max_length)