#include <algorithm>
#include <iostream>
#include <vector>

using ll = long long;

bool binary_search(ll x, const std::vector<ll> &a, int n) {
    int left = -1, right = n;
    while (right - left > 1) {
        int mid = (left + right) / 2;
        if (x > a.at(mid)) left = mid;
        else if (x < a.at(mid)) right = mid;
        else {
            return true;
        }
    }
    return false;
}

int main() {
    int n;
    ll m;
    std::cin >> n >> m;
    std::vector<ll> a(n);
    for (int i = 0; i < n; i++) {
        ll x;
        std::cin >> x;
        a.at(i) = x * 2;
    }
    std::sort(a.begin(), a.end());

    ll ans = 0;
    for (int i = 0; i < n; i++) {
        if (binary_search(a.at(i) + m, a, n)) {
            ans += static_cast<ll>(n - 2);
        }
    }
    std::cout << ans << std::endl;
}