#include<iostream>
#include<string>
#include<vector>
#include<algorithm>
#include<numeric>
#include<cmath>
#include<utility>
#include<tuple>
#include<cstdint>
#include<cstdio>
#include<iomanip>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<deque>
#include<unordered_map>
#include<unordered_set>
#include<bitset>
#include<cctype>
#include<chrono>
#include<random>
#include<cassert>
#include<cstddef>
#include<iterator>
#include<string_view>
#include<type_traits>

#ifdef LOCAL
#  include "debug_print.hpp"
#  define debug(...) debug_print::multi_print(#__VA_ARGS__, __VA_ARGS__)
#else
#  define debug(...) (static_cast<void>(0))
#endif

using namespace std;
#define rep(i,n) for(int i=0; i<(n); i++)
#define rrep(i,n) for(int i=(n)-1; i>=0; i--)
#define FOR(i,a,b) for(int i=(a); i<(b); i++)
#define RFOR(i,a,b) for(int i=(b-1); i>=(a); i--)
#define ALL(v) v.begin(), v.end()
#define RALL(v) v.rbegin(), v.rend()
#define UNIQUE(v) v.erase( unique(v.begin(), v.end()), v.end() );
#define pb push_back
using ll = long long;
using D = double;
using LD = long double;
using P = pair<ll, ll>;
template<typename T> using PQ = priority_queue<T,vector<T>>;
template<typename T> using minPQ = priority_queue<T, vector<T>, greater<T>>;
template<class T>bool chmax(T &a, const T &b) { if (a<b) { a=b; return 1; } return 0; }
template<class T>bool chmin(T &a, const T &b) { if (b<a) { a=b; return 1; } return 0; }
void yesno(bool flag) {cout << (flag?"Yes":"No") << "\n";}

template<typename T, typename U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    os << p.first << " " << p.second;
    return os;
}
template<typename T, typename U>
istream &operator>>(istream &is, pair<T, U> &p) {
    is >> p.first >> p.second;
    return is;
}

template<typename T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    int s = (int)v.size();
    for (int i = 0; i < s; i++) os << (i ? " " : "") << v[i];
    return os;
}
template<typename T>
istream &operator>>(istream &is, vector<T> &v) {
    for (auto &x : v) is >> x;
    return is;
}
void in() {}
template<typename T, class... U>
void in(T &t, U &...u) {
    cin >> t;
    in(u...);
}
void out() { cout << "\n"; }
template<typename T, class... U, char sep = ' '>
void out(const T &t, const U &...u) {
    cout << t;
    if (sizeof...(u)) cout << sep;
    out(u...);
}
void outr() {}
template<typename T, class... U, char sep = ' '>
void outr(const T &t, const U &...u) {
    cout << t;
    outr(u...);
}

int main(){
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
    const ll INF = 1e18;
    int n,k,sx,sy,gx,gy; in(n,k,sx,sy,gx,gy);
    vector<int> x(n+2),y(n+2);
    rep(i,n) in(x[i],y[i]);
    x[n] = sx; y[n] = sy;
    x[n+1] = gx; y[n+1] = gy;
    int ok = 200000, ng = 0;
    while(ok-ng > 1){
        int mid = (ok+ng)/2;
        ll g[n+2][n+2];
        rep(i,n+2)rep(j,n+2){
            if(i == j){
                g[i][j] = 0;
                continue;
            }
            int dist = ( abs(x[i]-x[j]) + abs(y[i]-y[j])- 1) / mid;
            g[i][j] = dist;
        }
        minPQ<P> pq;
        pq.push({0,n});
        vector<ll> res(n+2, INF);
        res[n] = 0;
        while(pq.size()){
            auto [d, v] = pq.top(); pq.pop();
            if (res[v] < d) continue;
            rep(nv,n+2){
                if(nv == v) continue;
                ll cost = g[v][nv];
                if(res[nv] > cost + d){
                    res[nv] = cost + d;
                    pq.push({res[nv],nv});
                }
            }
        }
        if(res[n+1] <= k) ok = mid;
        else ng = mid;
    }
    out(ok);
}