import sys
#input = sys.stdin.readline
input = sys.stdin.buffer.readline #文字列はダメ
#sys.setrecursionlimit(1000000)
import bisect
#import itertools
#import random
#from heapq import heapify, heappop, heappush
#from collections import defaultdict 
#from collections import deque
#import copy
#import math
#from functools import lru_cache
#@lru_cache(maxsize=None)
#MOD = pow(10,9) + 7
#MOD = 998244353
#dx = [1,0,-1,0]
#dy = [0,1,0,-1]
#dx8 = [1,1,0,-1,-1,-1,0,1]
#dy8 = [0,1,1,1,0,-1,-1,-1]

def main():
    N,K = map(int,input().split())
    A = list(map(int,input().split()))
    A.sort()
    ans = 0
    for i,a in enumerate(A):
        b = (2*K+a-1)//a
        temp = N - bisect.bisect_left(A,b)
        ans += temp
    print(ans)


if __name__ == '__main__':
    main()