import sys, math
sys.setrecursionlimit(10**8)
sys.set_int_max_str_digits(0)
INF = 1e18
MOD = 998244353
from bisect import bisect_left, bisect_right
from collections import deque, defaultdict, Counter
from itertools import product, combinations, permutations, groupby, accumulate
from heapq import heapify, heappop, heappush
input = sys.stdin.readline
def I():   return input().rstrip()
def II():  return int(input().rstrip())
def IS():  return input().rstrip().split()
def MII(): return map(int, input().rstrip().split())
def LI():  return list(input().rstrip())
def TII(): return tuple(map(int, input().rstrip().split()))
def LII(): return list(map(int, input().rstrip().split()))
def LSI(): return list(map(str, input().rstrip().split()))
def GMI(): return list(map(lambda x: int(x) - 1, input().rstrip().split()))
def kiriage(a, b): return (a+b-1)//b

N, D = MII()
A = LII()

left, right = defaultdict(int), defaultdict(int)

# 初期状態
left[A[0]] += 1

for i in range(1, N):
    right[A[i]] += 1

ans = 0
for i in range(1, N - 1):
    a = A[i]

    # right から削除
    right[a] -= 1

    # カウント
    ans += left[a - D] * right[a + D]

    # left に追加
    left[a] += 1

print(ans)