#include <bits/stdc++.h>
using namespace std;
using ll=long long;
using pll=pair<ll,ll>;
using tll=tuple<ll,ll,ll>;
using ld=long double;
const ll INF=(1ll<<60);
#define rep(i,n) for (ll i=0;i<(ll)(n);i++)
#define all(v) v.begin(),v.end()
template<class T> void chmin(T &a,T b){
    if(a>b){
        a=b;
    }
}
template<class T> void chmax(T &a,T b){
    if(a<b){
        a=b;
    }
}
struct edge{
    ll to;
	ll cost;
	edge(ll to,ll cost) : to(to),cost(cost) {};
};
struct graph{
    ll v;
    vector<vector<edge>> g;
    vector<ll> d,prev;
    graph(ll n){
        v=n;
        g.resize(v);
        d.resize(v,INF);
        prev.resize(v,-1);
    }
    void add_edge(ll s,ll t,ll cost){
        g[s].push_back({t,cost});
    }
    void dijkstra(ll s){
        rep(i,d.size()){
            d[i]=INF;
        }
        priority_queue<pll,vector<pll>,greater<pll>> pq;
        d[s]=0;
        pq.push({0,s});
        while(!pq.empty()){
            ll x_dist,x_vertex;
            tie(x_dist,x_vertex)=pq.top();
            pq.pop();
            if(d[x_vertex]<x_dist) continue;
            for(auto edge:g[x_vertex]){
                if(d[x_vertex]+edge.cost<d[edge.to]){
                    d[edge.to]=d[x_vertex]+edge.cost;
                    prev[edge.to]=x_vertex;
                    pq.push({d[edge.to],edge.to});
                }
            }
        }
    }
};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(nullptr);
    ll n,k;
    cin >> n >> k;
    ll sx,sy,gx,gy;
    cin >> sx >> sy >> gx >> gy;
    vector<ll> x(n),y(n);
    rep(i,n) cin >> x[i] >> y[i];
    x.push_back(sx);
    y.push_back(sy);
    x.push_back(gx);
    y.push_back(gy);
    ll ok=2e5,ng=-1;
    while(1<abs(ok-ng)){
        ll mid=(ok+ng)/2;
        graph g(n+2);
        rep(i,n+2){
            rep(j,n+2){
                if(i==j) continue;
                ll d=abs(x[i]-x[j])+abs(y[i]-y[j]);
                if(mid==0){
                    if(d<=mid) g.add_edge(i,j,0);
                }else{
                    g.add_edge(i,j,(d-mid+mid-1)/mid);
                }
            }
        }
        g.dijkstra(n);
        if(g.d[n+1]<=k) ok=mid;
        else ng=mid;
    }
    cout << ok << '\n';
}