#include <cassert>
#include <cmath>
#include <algorithm>
#include <iostream>
#include <iomanip>
#include <climits>
#include <map>
#include <queue>
#include <set>
#include <cstring>
#include <vector>

using namespace std;
typedef long long ll;

int N, K;
int SX, SY, GX, GY;
int X[510];
int Y[510];

struct Node {
  int id;
  int k;

  Node(int id = -1, int k = -1) {
    this->id = id;
    this->k = k;
  }

  bool operator>(const Node &n) const {
    return k < n.k;
  }
};

bool f(int P) {
  priority_queue <Node, vector<Node>, greater<Node>> pque;
  pque.push(Node(0, K));
  bool visited[N + 2];
  memset(visited, false, sizeof(visited));

  while (not pque.empty()) {
    Node node = pque.top();
    pque.pop();
    int x = X[node.id];
    int y = Y[node.id];

    if (visited[node.id]) continue;
    visited[node.id] = true;

    if (node.id == N + 1) {
      return true;
    }

    for (int i = 1; i <= N + 1; ++i) {
      if (visited[i]) continue;

      int nx = X[i];
      int ny = Y[i];
      int dist = abs(y - ny) + abs(x - nx);
      int cost = (dist <= P) ? 0 : (dist - 1) / P;
      if (node.k < cost) continue;

      pque.push(Node(i, node.k - cost));
    }
  }

  return false;
}

int main() {
  cin >> N >> K;
  cin >> SX >> SY >> GX >> GY;
  for (int i = 1; i <= N; ++i) {
    cin >> X[i] >> Y[i];
  }
  X[0] = SX;
  Y[0] = SY;
  X[N + 1] = GX;
  Y[N + 1] = GY;

  int ok = 100000000;
  int ng = 0;

  while (abs(ok - ng) >= 2) {
    int p = (ok + ng) / 2;

    if (f(p)) {
      ok = p;
    } else {
      ng = p;
    }
  }

  cout << ok << endl;

  return 0;
}