N, K = map(int, input().split())
sx, sy, gx, gy = map(int, input().split())
xy = [(sx, sy), (gx, gy)]+[tuple(map(int, input().split())) for i in range(N)]
N += 2
ans_min = 0
ans_max = 2*10**5


def dis(i, j):
    return abs(xy[i][0]-xy[j][0])+abs(xy[i][1]-xy[j][1])


while ans_max-ans_min > 1:
    ans_mid = (ans_max+ans_min)//2
    tmp = [[(dis(i, j)-1)//ans_mid if i != j else 0 for j in range(N)]
           for i in range(N)]
    for k in range(N):
        for i in range(N-1):
            if i == k:
                continue
            for j in range(i+1, N):
                if j == k:
                    continue
                tmp[i][j] = min(tmp[i][j], tmp[i][k]+tmp[k][j])
                tmp[j][i] = min(tmp[j][i], tmp[j][k]+tmp[k][i])
    if tmp[0][1] <= K:
        ans_max = ans_mid
    else:
        ans_min = ans_mid
print(ans_max)