#include<cstdio>
#include<iostream>
#include<algorithm>
using namespace std;

const int N=1805;
long long a[N][N];
long long dix[N],diy[N];
long long ans=0;
long long maxx=0;
long long ans1=0;
int n,m;

int main(){
	freopen("safenum.in","w",stdin);
	freopen("safenum.out","r",stdout);
	scanf("%d%d",&n,&m);
	for(int i=1;i<=m;i++){
		cin>>dix[i]>>diy[i];
	}
	for(int i=1;i<=m;i++){
		if(dix[i]>1&&diy[i]>2) a[dix[i]-1][diy[i]-2]++;
		if(dix[i]>2&&diy[i]>1) a[dix[i]-2][diy[i]-1]++;
		if(dix[i]<n-1&&diy[i]>2) a[dix[i]+1][diy[i]-2]++;
		if(dix[i]<n-2&&diy[i]>1) a[dix[i]+2][diy[i]-1]++;
		if(dix[i]>2&&diy[i]<n-1) a[dix[i]-2][diy[i]+1]++;
		if(dix[i]>1&&diy[i]<n-2) a[dix[i]-1][diy[i]+2]++;
		if(dix[i]<n-1&&diy[i]<n-2) a[dix[i]+1][diy[i]+2]++;
		if(dix[i]<n-2&&diy[i]<n-1) a[dix[i]+2][diy[i]+1]++;
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			a[dix[i]][dix[j]]++;
			if(a[i][j]==0) ans++;
			if(a[i][j]>maxx) maxx=a[i][j];
		}
	}
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(a[i][j]==maxx) ans1++;
		}
	}
	printf("%d\n",ans);
	cout<<maxx<<" "<<ans1;
	return 0;
}