#include<iostream>
#include<vector>
#include<string>
#include<algorithm>
#include<set>
#include<queue>
#include<cassert>
#include<cmath>
#include<iomanip>
#include<map>
#include<functional>
//#include<bits/stdc++.h>
using namespace std;
using ll = long long;


template< typename T >
struct edge{
    int from,to;
    T cost;
    edge(int from,int to, T cost):from(from),to(to),cost(cost){};
    edge &operator=(const int& x){
        to = x;
        return *this;
    }
};

template< typename T >
struct graph{
    int n;
    vector<vector<edge<T>>> e;
    graph(int n):n(n),e(n){}

    void addedge(int from,int to,T cost){
        e[from].emplace_back(from,to,cost);
    }

    vector<edge<T>> &operator[](int i) {
        return e[i];
    }
};

/*
 * O(ElogV)
 * 蛻ｰ驕比ｸ崎・縺ｮ蝣ｴ蜷医・窶・縺悟・縺｣縺ｦ繧九€・ */
template< typename T >
vector<T> dijkstra(graph<T>& g, int st){
    int n = g.n;
    using pt = pair<T,int>;
    vector<T> dist(n,-1);
    dist[st] = 0;
    priority_queue<pt, vector<pt>, greater<pt>>que;
    que.emplace(0,st);
    while(que.size()){
        int ni;
        T cost;
        tie(cost,ni) = que.top();
        que.pop();
        if(dist[ni]<cost&&dist[ni]!=-1) continue;
        for(edge<T> itr:g[ni]){
            int nxt = itr.to;
            if(dist[nxt]>cost+itr.cost||dist[nxt]==-1){
                dist[nxt] = cost + itr.cost;
                que.emplace(dist[nxt],nxt);
            }
        }
    }
    return dist;
};

int main(){
    int n,k,sx,sy,gx,gy;
    cin>>n>>k>>sx>>sy>>gx>>gy;
    vector<int> x(n),y(n);
    for(int i = 0;i<n;i++) cin>>x[i]>>y[i];
    int right = 1e9;
    int left = 0;
    while(right-left>1){
        int mid = (right+left)/2;
        graph<int> g(n+2);
        int s = n;
        int t = s + 1;
        for(int i = 0;i<n;i++){
            int now = abs(sx-x[i]) + abs(sy-y[i]) - 1;
            g.addedge(s,i,now/mid);
            now = abs(x[i]-gx) + abs(y[i]-gy) - 1;
            g.addedge(i,t,now/mid);
            for(int j = i + 1;j<n;j++){
                int now = abs(x[i]-x[j]) + abs(y[i]-y[j]) - 1;
                g.addedge(i,j,now/mid);
                g.addedge(j,i,now/mid);
            }
        }
        int can = dijkstra<int>(g,s)[t];
        if(can<=k) right = mid;
        else left = mid;
    }
    cout<<right<<endl;

}