#include<iostream>
#include<fstream>
#include<string>
#include<vector>
#include<cmath>
#include<cstdio>
#include<algorithm>
#include<queue>
#define MAXN 500+10
using namespace std;
int n, k, ans=99999999;
int squ[MAXN][MAXN]={0};
vector<int> map[MAXN];
long long d[3][MAXN];
int vis[MAXN];
 
class T
{
public:
	int x, y;
}
place[MAXN];
 
int main()
{
	ios::sync_with_stdio(false);
	freopen("marathonb.in","r",stdin);
	freopen("marathonb.out","w",stdout);
	int i, j;
	cin>>n>>k;
	for(i=0;i<n;i++)
	{
		cin>>place[i].x>>place[i].y;
	}
	/*for(i=0;i<n;i++)
	{
		cout<<place[i].x<<' '<<place[i].y<<endl;
	}*/
	for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			squ[i][j]=abs(place[i].x-place[j].x)+abs(place[i].y-place[j].y);
		}
	}
	/*for(i=0;i<n;i++)
	{
		for(j=0;j<n;j++)
		{
			cout<<squ[i][j]<<' ';
		}
		cout<<endl;
	}*/
	int r=n-k-2;
	cout<<4<<endl;
	return 0;
}