#include<iostream> #include<vector> #include<algorithm> using namespace std; int N,K; int X[502],Y[502]; int dist[502]; bool used[502]; int main() { cin>>N>>K; for(int i=0;i<N+2;i++)cin>>X[i]>>Y[i]; N+=2; int LP=0,RP=(int)2e5; while(RP-LP>1) { int P=(LP+RP)/2; for(int i=0;i<N;i++)dist[i]=K+1,used[i]=false; dist[0]=0; for(int t=0;t<N;t++) { int mi=-1; for(int i=0;i<N;i++)if(!used[i]) { if(mi==-1||dist[mi]>dist[i])mi=i; } if(mi==-1||dist[mi]>K)break; used[mi]=true; for(int j=0;j<N;j++)if(!used[j]) { int t=abs(X[j]-X[mi])+abs(Y[j]-Y[mi]); t=(t-1)/P; if(dist[j]>dist[mi]+t)dist[j]=dist[mi]+t; } } if(dist[1]<=K)RP=P; else LP=P; } cout<<RP<<endl; }