from heapq import *

# ダイクストラ
def dijkstra(k):
    D = [INF] * (N + 2)
    D[0] = 0
    q = [(0, 0)]
    while len(q) > 0:
        d, u = heappop(q)
        xu, yu = XY[u]
        # 下のifでTLE解消することがある
        if d > D[u]: continue
        for v in range(N + 2):
            if u == v:
                continue
            xv, yv = XY[v]
            duv = (abs(xu - xv) + abs(yu - yv) - 1) // k
            if D[v] > D[u] + duv:
                D[v] = D[u] + duv
                heappush(q, (D[v], v))
    return D[N + 1]

N, K = map(int, input().split())
sx, sy, gx, gy = map(int, input().split())
XY = [[sx, sy]] + [list(map(int, input().split())) for _ in range(N)] + [[gx, gy]]
INF = 10 ** 6
dmax = abs(sx - gx) + abs(sy - gy)
ub = dmax
lb = 0

while ub - lb > 1:
    mid = (lb + ub) // 2
    if dijkstra(mid) <= K:
        ub = mid
    else:
        lb = mid
print(ub)