import bisect


def main():
    N, K = map(int, input().split())
    A = list(map(int, input().split()))
    A.sort()
    length = len(A)
    patterns = 0
    for bottom in A:
        height = 2 * K / bottom
        height_lower_index = bisect.bisect_left(A, height)
        patterns += length - height_lower_index

    print(patterns)


if __name__ == "__main__":
    main()