#include <bits/stdc++.h>
#ifdef LOCAL
#include <debug.hpp>
#else
#define debug(...) void(0)
#endif

using namespace std;

typedef long long ll;
#define all(x) begin(x), end(x)
constexpr int INF = (1 << 30) - 1;
constexpr long long IINF = (1LL << 60) - 1;
constexpr int dx[4] = {1, 0, -1, 0}, dy[4] = {0, 1, 0, -1};

template <class T> istream& operator>>(istream& is, vector<T>& v) {
    for (auto& x : v) is >> x;
    return is;
}

template <class T> ostream& operator<<(ostream& os, const vector<T>& v) {
    auto sep = "";
    for (const auto& x : v) os << exchange(sep, " ") << x;
    return os;
}

template <class T, class U = T> bool chmin(T& x, U&& y) { return y < x and (x = forward<U>(y), true); }

template <class T, class U = T> bool chmax(T& x, U&& y) { return x < y and (x = forward<U>(y), true); }

template <class T> void mkuni(vector<T>& v) {
    sort(begin(v), end(v));
    v.erase(unique(begin(v), end(v)), end(v));
}

template <class T> int lwb(const vector<T>& v, const T& x) { return lower_bound(begin(v), end(v), x) - begin(v); }

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] >> y[N] >> x[N + 1] >> y[N + 1];
    for (int i = 0; i < N; i++) cin >> x[i] >> y[i];

    auto d = [&](int i, int j) { return abs(x[i] - x[j]) + abs(y[i] - y[j]); };
    auto calc = [&](int x) {
        vector<int> dp(N + 2, INF);
        vector<bool> seen(N + 2, false);
        dp[N] = 0;
        while (true) {
            int argmin = -1, mini = INF;
            for (int i = 0; i < N + 2; i++) {
                if (seen[i]) continue;
                if (chmin(mini, dp[i])) argmin = i;
            }
            if (argmin == -1) break;
            seen[argmin] = true;
            for (int i = 0; i < N + 2; i++) {
                if (i == argmin) continue;
                chmin(dp[i], dp[argmin] + (d(argmin, i) - 1) / x);
            }
        }
        return dp[N + 1];
    };

    int lb = 0, ub = 500010;
    while (ub - lb > 1) {
        int mid = (ub + lb) >> 1;
        (calc(mid) <= K ? ub : lb) = mid;
    }
    cout << ub << '\n';
    return 0;
}