#include <bits/stdc++.h>
using namespace std;
int N,S,qp[1805][1805],m=-1,num=0, s=0;
void pd(int Xx,int Yy)
{
    if(Xx<=0||Xx>N||Yy<=0||Yy>N)return ;
    else
    {
        qp[Xx][Yy]++;
        if(qp[Xx][Yy]==1)s++;
        if(qp[Xx][Yy]>m)
        {
            m=qp[Xx][Yy];
            num=1;
        }
        else if(qp[Xx][Yy]==m)
        {
            num++;
        }
    }
    
    return ;
}
void shao(int X,int Y)
{
    pd(X,Y);
    pd(X-2,Y-1);
    pd(X-2,Y+1);
    pd(X-1,Y+2);
    pd(X-1,Y-2);
    pd(X+2,Y-1);
    pd(X+2,Y+1);
    pd(X+1,Y+2);
    pd(X+1,Y-2);
    return ;
}
int main()
{
    freopen("safenum.in","r",stdin);
    freopen("safenum.out","w",stdout);
    cin>>N>>S;
    for(int i=1;i<=S;i++)
    {
        int x,y;
        cin>>x>>y;
        shao(x,y);
    }
    cout<<N*N-s<<endl<<m<<" "<<num;
    return 0;
}