#include <bits/stdc++.h>
using namespace std;
const int N = 1e6 + 10;
int q[N];
int res;
int main()
{
    int n,m;
    cin>>n>>m;
    for(int i=0;i<n;i++) scanf("%lld",&q[i]);
    sort(q,q+n);
    for(int i=0;i<n;i++)
    {
        int x=q[i];
        int l=0,r=n-1;
        if(q[i]>m)
        {
            while(l<r)
            {
                int mid=(l+r)/2;
                if(q[mid]>=x-m) r=mid;
                else l=mid+1;
            }
            int t=l;
            l=0,r=n-1;
            while(l<r)
            {
                int mid=(l+r+1)/2;
                if(q[mid]<=x-m) l=mid;
                else r=mid-1;
            }
            if(x-q[t]==m&&x-q[l]==m) 
            {
                res+=l-t+ 1;
            }
        }
    }
    cout<<res;
    return 0;
}