import sys
from sys import stdin
import math
import heapq

N,K = map(int,stdin.readline().split())

sx,sy,gx,gy = map(int,stdin.readline().split())

xy = [(sx,sy)]
for i in range(N):
    x,y = map(int,stdin.readline().split())
    xy.append((x,y))
xy.append((gx,gy))

N += 2

l = 0
r = abs(sx-gx) + abs(sy-gy) + 1

while r-l != 1:

    P = (l+r)//2

    d = [float("inf")] * N
    d[0] = 0

    q = [ (0,0) ]

    while q:
        c,v = heapq.heappop(q)
        if d[v] != c:
            continue
        vx,vy = xy[v]

        for nex in range(N):
            nx,ny = xy[nex]
            ln = (abs(nx-vx)+abs(ny-vy)+P-1) // P + d[v] - 1

            if nex != v and d[nex] > ln:
                d[nex] = ln
                heapq.heappush(q,(ln,nex))
    
    # print (l,r,d)
    if d[-1] <= K:
        r = P
    else:
        l = P

print (r)