#include<bits/stdc++.h>

using namespace std;

typedef long long ll;

const int N=1e5+;

struct point{ll d[];}a[N];

struct node{int mn[],mx[],lc,rc;point a;}t[N];

priority_queue<ll,vector<ll>,greater<ll> >q;

int n,m,rt,D;

bool operator<(point a,point b){return a.d[D]<b.d[D];}

void pushup(int x,int y)

{

    t[x].mn[]=min(t[x].mn[],t[y].mn[]);

    t[x].mn[]=min(t[x].mn[],t[y].mn[]);

    t[x].mx[]=max(t[x].mx[],t[y].mx[]);

    t[x].mx[]=max(t[x].mx[],t[y].mx[]);

}

void build(int&k,int l,int r,int d)

{

    k=;

    if(l>r)return;

    D=d;

    int mid=l+r>>;

    nth_element(a+l,a+mid,a+r+);

    k=mid;

    t[k].mn[]=t[k].mx[]=t[k].a.d[]=a[k].d[];

    t[k].mn[]=t[k].mx[]=t[k].a.d[]=a[k].d[];

    build(t[k].lc,l,mid-,d^);

    if(t[k].lc)pushup(k,t[k].lc);

    build(t[k].rc,mid+,r,d^);

    if(t[k].rc)pushup(k,t[k].rc);

}

ll getdis(point a,point b)

{return(a.d[]-b.d[])*(a.d[]-b.d[])+(a.d[]-b.d[])*(a.d[]-b.d[]);}

ll getdis2(point a,node b)

{

    ll ret=;

    ret=max(ret,getdis(a,(point){b.mn[],b.mn[]}));

    ret=max(ret,getdis(a,(point){b.mn[],b.mx[]}));

    ret=max(ret,getdis(a,(point){b.mx[],b.mn[]}));

    ret=max(ret,getdis(a,(point){b.mx[],b.mx[]}));

    return ret;

}

void query(int k,point a)

{

    ll dis=getdis(a,t[k].a);

    if(dis>q.top())q.pop(),q.push(dis);

    if(t[k].lc)

    {

        dis=getdis2(a,t[t[k].lc]);

        if(dis>q.top())query(t[k].lc,a);

    }

    if(t[k].rc)

    {

        dis=getdis2(a,t[t[k].rc]);

        if(dis>q.top())query(t[k].rc,a);

    }

}

int main()

{

    scanf("%d%d",&n,&m);

    for(int i=;i<=n;i++)scanf("%lld%lld",&a[i].d[],&a[i].d[]);

    build(rt,,n,);

    for(int i=;i<=m*;i++)q.push();

    for(int i=;i<=n;i++)query(rt,a[i]);

    printf("%lld",q.top());

}