#include<bits/stdc++.h>
using namespace std;
using ll=long long;
using P=pair<ll,ll>;

int main(){
  ll n,k;
  cin>>n>>k;
  ll sx,sy,gx,gy;
  cin>>sx>>sy>>gx>>gy;
  vector<ll> x(n+2),y(n+2);
  x[0]=sx;
  y[0]=sy;
  x[n+1]=gx;
  y[n+1]=gy;
  for(ll i=1;i<=n;i++){
    cin>>x[i]>>y[i];
  }
  ll ok=1e6,ng=0;
  while(abs(ok-ng)>1){
    ll mid=(ok+ng)/2;
    vector<ll> dist(n+2,1e18);
    dist[0]=0;
    priority_queue<P,vector<P>,greater<P>> que;
    que.push(P(dist[0],0));
    while(que.size()){
      P q=que.top();
      que.pop();
      ll from=q.second;
      if(dist[from]<q.first){
        continue;
      }
      for(ll to=0;to<=n+1;to++){
        ll next=max((ll)0,dist[from]+(abs(x[to]-x[from])+abs(y[to]-y[from])-1)/mid);
        if(dist[to]>next){
          dist[to]=dist[from]+next;
          que.push(P(dist[to],to));
        }
      }
      if(dist[n+1]<=k){
        break;
      }
    }
    if(dist[n+1]<=k){
      ok=mid;
    }else{
      ng=mid;
    }
  }
  cout<<ok<<endl;
}