#include<bits/stdc++.h>
using namespace std;
typedef long long ll;
#define N 2005
int n,m,ma[N][N],num,maxn,ans;
int dx[8]={-2,-2,-1,-1,1,1,2,2};
int dy[8]={-1,1,-2,2,-2,2,-1,1}; 
int read(){
	int w=0,f=1;
	char c=getchar();
	while (c>'9'||c<'0'){
		if (c=='-') f=-1;
		c=getchar();
	}
	while (c>='0'&&c<='9'){
		w=(w<<3)+(w<<1)+(c^48);
		c=getchar();
	}
	return w*f;
}
int main(){
	freopen("safenum.in","r",stdin);
	freopen("safenum.out","w",stdout);
	n=read(),m=read();
	for (int i=1;i<=m;i++){
		int a=read(),b=read();
		++ma[a][b];
		for (int j=0;j<8;j++){
			int xx=a+dx[j],yy=b+dy[j];
			if (xx>=1&&xx<=n&&yy>=1&&yy<=n){
				++ma[xx][yy];
			}
		}
	}
	for (int i=1;i<=n;i++){
		for (int j=1;j<=n;j++){
			if (ma[i][j]==0) num++;
			if (ma[i][j]>maxn) maxn=ma[i][j],ans=1;
			else if (ma[i][j]==maxn) ans++;
		}
	}
	printf("%d\n%d %d\n",num,maxn,ans);
	return 0;
}