#include <bits/stdc++.h>
using namespace std;
long long n,m;
long long a[1805][1805];//从1开始 
long long x,y;
long long num;
long long maxn=-(1e18);
long long max_num;
inline void change(long long x,long long y){
	const long long dx[8]={-2,-2,-1,1,2,2,1,-1};
	const long long dy[8]={-1,1,2,2,1,-1,-2,-2};
	for(int d=0;d<8;++d){
		if(x+dx[d] >=1&&x+dx[d]<=n&&y+dy[d]>=1&&y+dy[d]<=n){
			a[x+dx[d]][y+dy[d]]++;
		}
	}
}
int main(){
	freopen("safenum.in","r",stdin);
	freopen("safenum.out","w",stdout);
	scanf("%lld %lld",&n,&m);
	for(long long i=1;i<=m;++i){
		scanf("%lld %lld",&x,&y);
		a[x][y]++;
		change(x,y);
	}
	for(long long i=1;i<=n;++i){
		for(long long j=1;j<=n;++j){
			if(!a[i][j]){
				++num;
			}
			if(a[i][j] == maxn){
				++max_num;
			}
			if(a[i][j] > maxn){
				maxn = a[i][j];
				max_num = 1;
			}
		}
	}
	printf("%lld\n%lld %lld",num,maxn,max_num);
}