#include<iostream>
#include<cstring>
#include<cstdio>
using namespace std;
long long a[1801][1801],x,y,n,m,maxn,num,p;
int main(){
	freopen("safenum.in","r",stdin);
	freopen("safenum.out","w",stdout);
	scanf("%d %d",&x,&y);
	long long p=x*x;
	for(int i=1;i<=y;i++){
		cin>>n>>m;
		if(n==1){
		a[n][m]++;
		a[n+1][m-2]++;
		a[n+1][m+2]++;
		a[n+2][m+1]++;
		a[n+2][m-1]++;
		continue;
		}
		a[n][m]++;
		a[n-1][m+2]++;
		a[n-1][m-2]++;
		a[n+1][m-2]++;
		a[n+1][m+2]++;
		a[n-2][m+1]++;
		a[n-2][m-1]++;
		a[n+2][m+1]++;
		a[n+2][m-1]++;
	}for(int i=1;i<=x;i++){
		for(int j=1;j<=x;j++){
			if(a[i][j]!=0){
				p--;
				if(a[i][j]>maxn){
				maxn=a[i][j];
				num=1;
				} 
				else if(a[i][j]==maxn) num++;
			}
		}
	}cout<<p<<endl;
	printf("%lld %lld",maxn,num);
	return 0;
}