#include<bits/stdc++.h>
using namespace std;
int n,m,x,y;
int zeroamount=0,highamount=0;
int defend[1805][1805];
int biao1[]={0,-2,-1,1,2,2,1,-1,-2};
int biao2[]={0,1,2,2,1,-1,-2,-2,-1};
int main(){
    ios::sync_with_stdio(false);
    cin.tie(0);
    freopen("safenum.in","r",stdin);
    freopen("safenum.out","w",stdout);
    memset(defend,0,sizeof(defend));
    cin>>n>>m;
    int maxnum=-1;
    for(int i=0;i<m;i++){
        cin>>x>>y;
        x++;
        y++;
        for (int j=0;j<=8;j++){
            int kk=(++defend[x+biao1[j]][y+biao2[j]]);
            maxnum=max(maxnum,kk);
        }
    }
    for(int i=2;i<=n+1;i++){
        for(int j=2;j<=n+1;j++){
            if(defend[i][j]==0){
                zeroamount++;
            }
            if(defend[i][j]==maxnum){
                highamount++;
            }
        }
    }
    cout<<zeroamount<<endl;
    cout<<maxnum<<" "<<highamount;
    return 0;
}