#include <bits/stdc++.h>
//#include <atcoder/all>
using namespace std;
//using namespace atcoder;
//using mint = modint1000000007;
//const int mod = 1000000007;
//using mint = modint998244353;
//const int mod = 998244353;
const int INF = 1e9;
//const long long LINF = 1e18;
#define rep(i, n) for (int i = 0; i < (n); ++i)
#define rep2(i,l,r)for(int i=(l);i<(r);++i)
#define rrep(i, n) for (int i = (n-1); i >= 0; --i)
#define rrep2(i,l,r)for(int i=(r-1);i>=(l);--i)
#define all(x) (x).begin(),(x).end()
#define allR(x) (x).rbegin(),(x).rend()
#define endl "\n"
#define P pair<int,int>
template<typename A, typename B> inline bool chmax(A & a, const B & b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A & a, const B & b) { if (a > b) { a = b; return true; } return false; }

int main() {
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int n, k; cin >> n >> k;
	vector<int>x(n + 2), y(n + 2);
	cin >> x[n + 0] >> y[n + 0];
	cin >> x[n + 1] >> y[n + 1];
	rep(i, n)cin >> x[i] >> y[i];
	int ng = 0;
	int ok = 200005;
	while (1 < abs(ok - ng)) {
		int mid = (ng + ok) / 2;
		auto check = [&]() {
			vector<int>dp(n + 2, INF);
			priority_queue<P, vector<P>, greater<P>> q;
			q.push({ 0, n });
			dp[n] = 0;
			while (!q.empty()) {
				auto tmp = q.top();
				q.pop();
				int cost = tmp.first;
				int pos = tmp.second;
				if (cost > dp[pos]) continue;
				rep(i, n + 2) {
					if (i == pos)continue;
					int dist = abs(x[i] - x[pos]) + abs(y[i] - y[pos]);
					int ncost = cost + (dist - 1) / mid;
					if (chmin(dp[i], ncost)) q.push({ ncost, i });
				}
			}
			return dp[n + 1] <= k;
		};
		if (check()) ok = mid;
		else ng = mid;
	}
	cout << ok << endl;
	return 0;
}