#include <bits/stdc++.h>
using namespace std;
typedef pair<int,int> pii;
typedef vector<pair<int,int> > vpii;
typedef vector<int> vi;
#define mp make_pair
#define pb push_back
typedef long long ll;
typedef long long int LLI;
#define SZ 300099
int n,k;
typedef pair<int,int> pii;
pii p[SZ];
ll sqr(ll a) {return a*a;}
#define fi first
#define se second
ll dis(const pii&a,const pii&b) {
    return sqr(a.fi-b.fi)+sqr(a.se-b.se);
}
ll dis(int a,int b) {return dis(p[a],p[b]);}
typedef double ld;
const ll G=1.5e9;
vector<pair<ll,int>> gx;
bool chkgrid(ld g) {
    gx.clear();
    for(int i=1;i<=n;++i) {
        int X=(p[i].first+0.5)/g,Y=(p[i].second+0.5)/g;
        ll s=X*G+Y;
        gx.push_back({s,i});
    }
    sort(gx.begin(),gx.end());
    for(int r=0;r<gx.size();++r) {
        int l=r;
        while(r+1<gx.size()&&gx[r].fi==gx[r+1].fi) ++r;
        if(r-l+1>=3) return 1;
    }
    return 0;
}
int ff[SZ];
int gf(int x) {
    return ff[x]?ff[x]=gf(ff[x]):x;
}
vector<int> adj[SZ];
int vis[SZ];
int TS=0;
template<int typ>
bool bfs(int S,int up) {
    ++TS;
    if(typ&&vis[S]==TS-1) return 1;
    static int qs[SZ],dis[SZ]; int h=0,t=0;
    if(up==0) return 0;
    vis[S]=TS; dis[S]=0;
    qs[t++]=S;
    while(h^t) {
        int x=qs[h++];
        // cerr<<typ<<">"<<x<<":"<<up<<" "<<dis[x]<<"++\n";
        for(auto b:adj[x]) {
            // cerr<<x<<"->"<<b<<"\n";
            if(vis[b]==TS-1&&typ) return 1;
            if(vis[b]==TS) continue;
            vis[b]=TS; dis[b]=dis[x]+1;
            if(dis[b]!=up) qs[t++]=b;
        }
    }
    return 0;
}
int TAR;
namespace D0 {
int ins[SZ];
int vx[SZ];
int md[SZ],ff[SZ];
void dfs0(int s,int dis,int maxd) {
    if(ins[s]) return;
    if(vx[s]!=TS) {
        vx[s]=TS; md[s]=2e9; ff[s]=0;
    }
    if(dis<md[s]) {
        md[s]=dis, ++ff[s];
    }
    if(dis==maxd) return;
    ins[s]=1;
    for(auto b:adj[s]) dfs0(b,dis+1,maxd);
    ins[s]=0;
}
}
int main() {
    cin>>n>>k;
    for(int i=1;i<=n;++i)
        cin>>p[i].fi>>p[i].se;
    ld l=0.9999,r=2e9;
    for(int i=1;i<=50;++i) {
        auto m=(l+r)/2;
        if(chkgrid(m/sqrt(2))) r=m;
        else l=m;
    }
    ld Grid=l/sqrt(2);
    chkgrid(Grid);
    map<ll,vector<pii>> es;
    ll aa=0;
    for(int i=0;i<gx.size();++i) {
        int X=gx[i].fi/G,Y=gx[i].fi%G;
        for(int dx=-4;dx<=4;++dx) {
            for(int dy=-4;dy<=4;++dy) {
                int DX=max(abs(dx)-1,0);
                int DY=max(abs(dy)-1,0);
                //sqrt((DX^2+DY^2)/2)>=1
                if(DX*DX+DY*DY>=2) continue;
                if(pii(dx,dy)<pii(-dx,-dy)) continue;
                if(X+dx<0||Y+dy<0) continue;
                ll NX=(X+dx)*G+Y+dy;
                auto s=lower_bound(gx.begin(),gx.end(),mp(NX,-1))-gx.begin();
                for(int ii=s;ii<gx.size();++ii) {
                    if(gx[ii].fi!=NX) break;
                    int j=gx[ii].se;
                    int I=gx[i].se;
                    if(I!=j) {
                        es[dis(I,j)].pb({I,j});
                    }
//                    cout<<i<<"~"<<j<<"\n";
                }
            }
        }
    }
    set<pii> vv;
    for(auto &g:es) {
        ll D=g.fi;
        // cerr<<D<<" "<<g.se.size()<<"++\n";
        bool found=0;
        for(auto e:g.se) {
            if(e.fi>e.se) swap(e.fi,e.se);
            if(e.fi==e.se) continue;
            if(vv.count(e)) continue;
            vv.insert(e);
            int x=e.fi,y=e.se;
            int X=gf(x),Y=gf(y);
            // cerr<<x<<"--"<<y<<"\n";
            if(X!=Y) {
                ff[X]=Y;
            }
            else {
                // cerr<<"??\n";
//                cerr<<x<<"--"<<y<<"\n";
                bfs<0>(x,k/2+1);
                if(bfs<1>(y,k-k/2)) {
                    found=1;
                    using namespace D0;
                    TAR=y;
                    dfs0(x,1,k);
                    assert(vx[y]==TS);
                    // cerr<<x<<"->"<<y<<" "<<md[y]<<","<<D0::ff[y]<<"\n";
                    if(k<md[y]) continue;
                    if(k>md[y]) k=md[y],aa=0;
                    if(k==md[y]) aa+=D0::ff[y];
//                    dfs1(Y,k-k/2);
                }
            }
            // is it a good edge?
            adj[x].pb(y);
            adj[y].pb(x);
        }
        if(found) {
            cout<<D<<"\n"<<k<<"\n"<<aa*k*2<<"\n";
            return 0;
        }
    }
}