import bisect


def main():
    n, k = map(int, input().split())
    arr = list(map(int, input().split()))
    arr.sort()

    mx = len(arr)
    res = 0
    for x in arr:
        y = 2 * k / x
        idx = bisect.bisect_left(arr, y)
        res += mx - idx
    print(res)


if __name__ == "__main__":
    main()