#include <iostream>

 #define maxn 16006

 #include<algorithm>

 using namespace std;

 struct node{

     int x,y;

     int index;

 }q[maxn];

 int f[maxn],rank[maxn],sum[maxn];

 void init(int n){

     for(int i=;i<=n;i++){

         f[i] = i;

         rank[i]=;

     }

 }

 bool cmp_x(node a, node b){

     if(a.x==b.x)

         return a.y<b.y;

     return a.x<b.x;

 }

 bool cmp_y(node a,node b){

     if(a.y==b.y)

         return a.x<b.x;

     return a.y<b.y;

 }

 bool cmp(int x, int y){

     return x>y;

 }

 int find(int x){

     if(x!=f[x])

         f[x] = find(f[x]);

     return f[x];

 }

 void unin(int x, int y){

     int fx = find(x);

     int fy = find(y);

     if(fx==fy)

         return;

     if(rank[fx]>rank[fy]){

         rank[fx] += rank[fy];//求共有多少节点

         f[fy] = fx;

     }

     else {

         rank[fy] += rank[fx];

         f[fx] = fy;

     }

     return ;

 }

 int main()

 {

     int n , k;

     while(cin>>n>>k){

         init(n);

         for(int i=;i<=n;i++){

             cin>>q[i].x>>q[i].y;

             q[i].index=i;

         }

         sort(q+,q++n,cmp_x);//合并x方向

         for(int i=;i<n;i++){

             if(q[i].x==q[i+].x&&q[i].y+==q[i+].y)

                 unin(q[i].index,q[i+].index);

         }

         sort(q+,q++n,cmp_y);//合并y方向

         for(int i=;i<n;i++){

             if(q[i].y==q[i+].y&&q[i].x+==q[i+].x)

                 unin(q[i].index,q[i+].index);

         }

         int cnt =;

         for(int i=;i<=n;i++){//取出f[i]==i的节点

             if(f[i]==i)

                 sum[cnt++] = rank[i];

         }

         sort(sum,sum+cnt,cmp);//找出k个

         int ssum =;

         for(int i=;i<k;i++)

             ssum += sum[i];

         cout<<ssum<<endl;

     }

     return ;

 }