//#include<fstream>
#include<iostream>
#include<cstdio>
#include<algorithm>
using namespace std;
const int N=151;
int d,n,a[N][N]={0};
int ans1=0,ans2=0;
int solve(int x,int y,int d)
{
	int ans=0;
	int x1,y1;
	x1=x-d;y1=y-d;
	if(x1<0) x1=0;
	if(y1<0) y1=0;
	for(int i=y1;i<=y+d;i++)
	{
		for(int j=x1;j<=x+d;j++)
		{
			ans+=a[i][j];
		}
	}
	return ans;
}
int main()
{
	//freopen("wireless.in","r",stdin);
	//freopen("wireless.out","w",stdout);
	scanf("%d%d",&d,&n);
	int xmax,ymax;
	for(int i=1;i<=n;i++)
	{
		int x,y,k;
		scanf("%d%d%d",&x,&y,&k);
		a[y][x]=k;
		if(xmax<x) xmax=x;
		if(ymax<y) ymax=y;
	}
	for(int i=0;i<=ymax;i++)
	{
		for(int j=0;j<=xmax;j++)
		{
			int t;
			t=solve(j,i,d);
			if(t==ans2) ans1++;
			if(t>ans2)
			{
				ans1=1;
				ans2=t;
			}
		}
	}
	printf("%d %d",ans1,ans2);
	return 0;
}
/**************************************************************
	Problem: 2337
	User: admin
	Language: C++
	Result: Accepted
	Time:69 ms
	Memory:2168 kb
****************************************************************/