import sys
sys.setrecursionlimit(5*10**5)
input = sys.stdin.readline
from collections import defaultdict, deque, Counter
from heapq import heappop, heappush
from bisect import bisect_left, bisect_right
from math import gcd

n,k = map(int,input().split())
sx,sy,gx,gy = map(int,input().split())
xy = [[sx,sy]]
for i in range(n):
    xy.append(list(map(int,input().split())))
xy.append([gx,gy])
graph = [[] for i in range(n+2)]

for i in range(n+2):
    xi,yi = xy[i]
    for j in range(n+2):
        xj,yj = xy[j]
        if i == j: continue
        graph[i].append([j,abs(xi-xj) + abs(yi-yj)])


#ダイクストラ法
def dijkstra(s,n, p): # sがスタート、nが頂点数
    INF = 10**15
    dist = [INF]*(n+1)
    que = [(0,s)]
    dist[s] = 0
    while que:
        c,crr = heappop(que)
        if c > dist[crr]: continue
        for nxt, cost in graph[crr]:
            cnt = (cost-1)//p
            if dist[crr] + cnt < dist[nxt]:
                dist[nxt] = dist[crr] + cnt
                heappush(que,(dist[nxt],nxt))
    return dist[-2]

l = 1
r = 10**6

for i in range(40):
    m = (l+r)//2
    cnt = dijkstra(0, n+2, m)
    if cnt <= k:
        r = m
    else:
        l = m
    
print(r)