#include <bits/stdc++.h>
using namespace std;
const int N=1800+5;
int fx[]={0,-2,-1,1,2,2,1,-1,-2},fy[]={0,1,2,2,1,-1,-2,-2,-1};
int a[N][N]={0};
int main(){
    freopen ("safenum.in","r",stdin);
    freopen ("safenum.out","w",stdout);
    int n,m,mx=0,p=0,q=0;
    cin>>n>>m;
    for (int i=1;i<=m;i++){
        int x,y;
        scanf("%d%d",&x,&y);
        for (int j=0;j<=8;j++){
            a[x+fx[j]+1][y+fy[j]+1]++;
            mx=max(mx,a[x+fx[j]+1][y+fy[j]+1]);
        }
    }
    for (int i=1;i<=n;i++){
        for (int j=1;j<=n;j++){
            if (a[i+1][j+1]==mx)p++;
            if (a[i+1][j+1]==0)q++;
        }
    }
    cout<<q<<endl<<mx<<" "<<p<<endl;
    return 0;
}