#include<bits/stdc++.h>
using namespace std;

using ll = long long;
ll INF = 1LL << 58;
#define pb push_back
template<typename T> using min_priority_queue = priority_queue<T, vector<T>, greater<T>>;

int main() {
  
  ll N, K; cin >> N >> K;
  ll sx, sy, gx, gy; cin >> sx >> sy >> gx >> gy;
  vector<ll> X(N), Y(N);
  for (int i = 0; i < N; i++) {
    cin >> X[i] >> Y[i];
  }

  // N -> s, N + 1 -> g
  X.pb(sx); X.pb(gx);
  Y.pb(sy); Y.pb(gy);

  auto check = [&](ll P) -> bool {
    vector cost(N + 2, vector<ll>(N + 2));
    for (int i = 0; i < N + 2; i++) {
      for (int j = i; j < N + 2; j++) {
        ll m = abs(X[i] - X[j]) + abs(Y[i] - Y[j]);
        if (m == 0) m++;
        cost[i][j] = (m - 1) / P;
        cost[j][i] = (m - 1) / P;
      }
    }
    
    vector<ll> dist(N + 2, INF);
    min_priority_queue<pair<ll, ll>> que;
    que.push({0, N});
    dist[N] = 0;
    while (!que.empty()) {
      auto [d, i] = que.top(); que.pop();
      if (dist[i] != d) continue;
      for (int j = 0; j < N + 2; j++) {
        ll nv = dist[i] + cost[i][j];
        if (dist[j] > nv) {
          dist[j] = nv;
          que.push({nv, j});
        }
      }
    }
    
    return dist[N + 1] <= K;
  };

  ll ok = 101010, ng = 0;
  while (abs(ok - ng) > 1) {
    ll mid = (ok + ng) / 2;
    if (check(mid)) {
      ok = mid;
    } else {
      ng = mid;
    }
  }

  cout << ok << endl;
  
}