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

const int maxn=129;
int s[maxn+10][maxn+10];

int main()
{
    freopen("wireless.in","r",stdin);freopen("wireless.out","w",stdout);
    int d,n,i,j,x,y,k;
    int lx,rx,ly,ry;
    int sum,ans1=0,ans2=0;
    scanf("%d%d",&d,&n);
    for(i=1; i<=n; i++)
    {
        scanf("%d%d%d",&x,&y,&k);
        s[x][y]=k;
    }
    for(i=0; i<=128; i++)
        for(j=0; j<=128; j++)
        {
            lx=max(0,i-d),rx=min(i+d,128);
            ly=max(0,j-d),ry=min(j+d,128);
            for(sum=0,x=lx; x<=rx; x++)
                for(y=ly; y<=ry; y++)
                    sum+=s[x][y];
            if(sum>ans2)
                ans1=1,ans2=sum;
            else if(sum==ans2)
                ans1++;
        }
    printf("%d %d\n",ans1,ans2);
    return 0;
}