#include <cstdio>
#include <iostream>
#include <cstdlib>
using namespace std;
int N;
int C;
int A[200001];

int cmp(const void *a,const void *b)  
{  
    return *((int *)a)-*((int *)b);  
} 

int main()
{
	
	freopen("dec.in","r",stdin);
	freopen("dec.out","w",stdout);
	scanf("%d %d\n",&N,&C);
	for (int i=1;i<=N;i++)
		cin>>A[i];
	qsort(A+1,N,sizeof(int),cmp);
	int Tot=0;
	for (int i=1;i<=N;i++)
	{
		int s=1;
		int b=N;
		int need=A[i]-C;
		int mid;
		
		if(need<A[1] || need>A[N])
			continue;
		
		while (s<b)  
		{	  
			mid=(s+b)/2;  
			if(A[mid]==need)
				break;
			if (A[mid]<need)   
				s=mid+1;  
			else   
				b=mid;  
		}  
		for (int j=mid;j>=1;j--)
		{
			if(A[j]==need)
				Tot++;
			else
				break;
		}
		for (int j=mid+1;j<=N;j++)
		{
			if(A[j]==need)
				Tot++;
			else
				break;
		}
	}
	cout<<Tot<<endl;
	
	return 0;
}