#include <iostream>
#include <vector>
#include <algorithm>
#include <cstring>
using namespace std;
const int N = 2003;
int h[N], en[N], e[N], idx, num[N],a[N];
bool find(int x)
{
int k = (x % N + N) % N;
for (int i = h[k]; i != -1;i = en[i])
{
if (e[i] == x)return true;
}
return false;
}
void insert(int x)
{
int k = (x % N + N) % N;
if(!find(x))
{
e[idx] = x; en[idx] = h[k]; h[k]=idx++;
}num[x]++;
return;
}
int main()
{
int k = 0;
memset(h, -1, sizeof h);
int n,m;
cin >> n>>m;
for (int i = 0; i < n; i++)
{
cin >> a[i];
insert(a[i]);
a[i] -= m;
}
for (int i = 0; i < n; i++)
{
if (find(a[i]))k += num[a[i]];
}
cout << k << endl;
}