#include<iostream>
#include<vector>
#include<algorithm>
#include<cstring>
#include<cassert>
#include<cmath>
#include<ctime>
#include<iomanip>
#include<numeric>
#include<stack>
#include<queue>
#include<map>
#include<unordered_map>
#include<set>
#include<unordered_set>
#include<bitset>
#include<random>
#include<functional>
#include<utility>
using namespace std;
int N,K,x[502],y[502];
int dp[502][502];
void solve()
{
	cin >> N >> K;
	cin >> x[0] >> y[0] >> x[N+1] >> y[N+1];
	for(int i = 1;i <= N;i++) cin >> x[i] >> y[i];
	int ng = 0,ok = (int)2e5;
	while(ok-ng > 1)
	{
		int mid = (ok+ng)/2;
		for(int i = 0;i <= N+1;i++)for(int j = 0;j <= N+1;j++) 
		{
			int d = abs(x[i]-x[j]) + abs(y[i]-y[j]);
			dp[i][j] = (d-1)/mid;
		}
		for(int k = 0;k <= N+1;k++)for(int i = 0;i <= N+1;i++)for(int j = 0;j <= N+1;j++) dp[i][j] = min(dp[i][j],dp[i][k]+dp[k][j]);
		if(dp[0][N+1] <= K) ok = mid;
		else ng = mid;
	}
	cout << ok << endl;
}
int main()
{
	ios::sync_with_stdio(false);
	cin.tie(nullptr);
	int tt = 1;
	/* cin >> tt; */
	while(tt--) solve();
}