#include <iostream>
#include <cstdio>
using namespace std;
const int MAXN=1800*1805,MINN=1805;
long long m,n,x[MAXN],y[MAXN],dt[MINN][MINN];
int maxn,ans,sum=0;
int main(){
	freopen("safenum.in","r",stdin);
	freopen("safenum.out","w",stdout);
	cin >>n>>m;
	for(int i=1;i<=m;i++){
		cin >>x[i]>>y[i];
		dt[x[i]+1][y[i]+2]=dt[x[i]+1][y[i]+2]+1;//1
		dt[x[i]+2][y[i]+1]=dt[x[i]+2][y[i]+1]+1;//2
		dt[x[i]+1][y[i]-2]=dt[x[i]+1][y[i]-2]+1;//3
		dt[x[i]+2][y[i]-1]=dt[x[i]+2][y[i]-1]+1;//4
		dt[x[i]-1][y[i]+2]=dt[x[i]-1][y[i]+2]+1;//5
		dt[x[i]-2][y[i]+1]=dt[x[i]-2][y[i]+1]+1;//6
		dt[x[i]-1][y[i]-2]=dt[x[i]-1][y[i]-2]+1;//7
		dt[x[i]-2][y[i]-1]=dt[x[i]-2][y[i]-1]+1;//8
		dt[x[i]][y[i]]=dt[x[i]][y[i]]+1;//9
	}
	maxn=dt[1][1];
	for(int i=1;i<=n;i++){
		for(int j=1;j<=n;j++){
			if(dt[i][j]==0) ans=ans+1;
			if(dt[i][j]>maxn){
				maxn=dt[i][j];
				sum=0;
            }
            if(dt[i][j]==maxn) sum++;
		}
    }
    cout <<ans<<endl;
    cout <<maxn<<" "<<sum;
    return 0;
}