#include "bits/stdc++.h"

#include <stdio.h>
#include <math.h>

#pragma warning(push)
#pragma warning(disable:26498 26450 26451 26812)
#include "atcoder/all"
#pragma warning(pop)

//#include <boost/multiprecision/cpp_int.hpp>
//using namespace boost::multiprecision;
// std::fixed << std::setprecision(10) <<

using namespace std;
using namespace atcoder;

using ll = long long;
using ull = unsigned long long;
using mint = modint998244353;
using mint2 = modint1000000007;

const double eps = 1e-9;

#define REP(i, n) for (ll i = 0; i < ll(n); ++i)
#define REPI(i, init, n) for (ll i = init; i < ll(n); ++i)
#define REPD(i, init) for (ll i = init; i >=0; --i)
#define REPDI(i, init, n) for (ll i = init; i >=n; --i)
#define REPE(i, c) for (const auto& i : c)

using vl = vector<ll>;
#define VL(a, n) vector<ll> a; a.assign(n, 0);
#define VLI(a, n) vector<ll> a; a.assign(n, 0); for(auto& x : a) cin >> x;
#define VSI(a, n) vector<string> a; a.assign(n, ""); for(auto& x : a) cin >> x;

using vvl = vector<vector<ll>>;
#define VVLI(a, n, m, init) vector<vector<ll>> a(n); for(auto& x : a) x.assign(m, init);

struct uv { ll u; ll v; ll c; };
#define VUVI(a, n) vector<uv> a; a.assign(n, {0, 0, 1}); for(auto& x : a) {cin >> x.u >> x.v; x.u--; x.v--;}
#define VUVCI(a, n) vector<uv> a; a.assign(n, {0, 0, 0}); for(auto& x : a) {cin >> x.u >> x.v >> x.c; x.u--; x.v--;}
vvl to_edge(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) ret[x.u].push_back(x.v); return ret; }
vvl to_edge_d(const int n, const vector<uv>& v) { vvl ret(n); for (auto& x : v) { ret[x.u].push_back(x.v); ret[x.v].push_back(x.u); } return ret; }

template <class T = long long> using pql = priority_queue<T>;
template <class T = long long> using pqg = priority_queue<T, vector<T>, greater<T>>;

const char* YES = "Yes";
const char* NO = "No";
void yn(bool f) { std::cout << (f ? YES : NO) << endl; };
template<class T> void ov(const T& v) { for (auto it = v.begin(); it != v.end(); it++) { if (it != v.begin()) cout << " "; cout << *it; } };

const ll llhuge = 1LL << 60; //十分でかいが多少足しても溢れない数値
template<class T, class U> bool chmin(T& a, const U& b) { a = min(a, b); return b == a; }
template<class T, class U> bool chmax(T& a, const U& b) { a = max(a, b); return b == a; }
template<class T> void mysort(T& v) { std::sort(begin(v), end(v)); };
template<class T, class U> void mysort(T& v, U pr) { std::sort(begin(v), end(v), pr); };
template<class T> void myrev(T& v) { std::reverse(begin(v), end(v)); };

struct xy {
	ll x; ll y;
};

int main() {
	cin.tie(nullptr);
	ios::sync_with_stdio(false);

	ll n, k;
	cin >> n >> k;

	ll sx, sy, gx, gy;
	cin >> sx >> sy >> gx >> gy;

	vector<xy> v;
	v.push_back({ sx, sy });

	REP(i, n) {
		ll x, y;
		cin >> x >> y;
		v.push_back({ x, y });
	}
	v.push_back({ gx, gy });

	ll l = 1;
	ll r = 100000 * 2 + 1;
	while (l < r) {
		ll m = (l + r) / 2;

		pqg<pair<ll, ll>> q;
		q.push({ 0, 0 });
		vector<ll> dist(n + 2, llhuge);
		dist[0] = 0;
		while (!q.empty()) {
			auto cp = q.top();
			auto t = cp.second;
			q.pop();

			if (dist[t] < cp.first) continue;
			REP(i, n + 2) {
				if (i == cp.second) continue;
				const ll len = abs(v[i].x - v[t].x) + abs(v[i].y - v[t].y);
				const ll nc = (len - 1) / m + cp.first;
				if (dist[i] > nc) {
					dist[i] = nc;
					q.push({ nc, i });
				}
			}
		}

		if (dist[n + 1] <= k) {
			r = m;
		}
		else {
			l = m + 1;
		}
	}

	cout << l << endl;
}