#include <bits/stdc++.h>
using namespace std;
const int INF = 200000;
int main(){
  int N, K;
  cin >> N >> K;
  vector<int> x(N + 2), y(N + 2);
  cin >> x[0] >> y[0] >> x[1] >> y[1];
  for (int i = 2; i < N + 2; i++){
    cin >> x[i] >> y[i];
  }
  int tv = 200000, fv = 0;
  while (tv - fv > 1){
    int mid = (tv + fv) / 2;
    vector<int> d(N + 2, INF);
    d[0] = 0;
    vector<bool> used(N + 2, false);
    while (true){
      int p = -1;
      for (int i = 0; i < N + 2; i++){
        if (!used[i] && (p == -1 || d[i] < d[p])){
          p = i;
        }
      }
      if (p == -1){
        break;
      }
      used[p] = true;
      for (int i = 0; i < N + 2; i++){
        if (p != i){
          int a = abs(x[i] - x[p]) + abs(y[i] - y[p]);
          d[i] = min(d[i], d[p] + (a - 1) / mid);
        }
      }
    }
    if (d[1] <= K){
      tv = mid;
    } else {
      fv = mid;
    }
  }
  cout << tv << endl;
}