Как ускорить программу?

n, d = list(map(int, input().split()))
coords = list(map(int, input().split()))
pairs = 0
 
for i in range(n - 1):
    try:
        coords.index(coords[0] + d)
        pairs += 1
    except ValueError: pass
 
    try:
        coords.index(coords[0] - d)
        pairs += 1
    except ValueError: pass
    coords.pop(0)
print(pairs)

n, d = map(int, input().split())
coords = list(map(int, input().split()))
pairs = 0
coords.sort()
for i in range(n - 1):
    try:
        coords.index(coords[0] + d)
    except ValueError: pass
    else: pairs += 1
    finally: coords.pop(0)
print(pairs)

n, d = map(int, input().split())
coords = list(map(int, input().split()))
pairs = 0
coords.sort()
for i in range(len(coords)):
    for j in range (i + 1, len(coords)):
        if coords[j] - coords[i] == d:
            pairs += 1
            break
        elif coords[j] - coords[i] > d:
            break
print(pairs)

n, d = list(map(int, input().split()))
coords = list(map(int, input().split()))
coords.sort()
pairs = 0
for i in range(n - 1):
    left = i + 1
    right = n - 1
    mid = 0
    while left != right and coords[i] + d != coords[mid]:
        mid = (left + right) // 2
        if coords[mid] > coords[i] + d:
            right = mid - 1
        elif coords[mid] < coords[i] + d:
            left = mid + 1
    if left == right:
        if coords[i] + d == coords[left]:
            pairs += 1
    elif coords[i] + d == coords[mid]:
        pairs += 1
print(pairs)