#include<iostream>
#include<cstdio>
	int f[105][35];
	int t[105];
	int hei[105];
	int tt[105];
	int sum[105];
	int sumh[105];
	int d,n,ans;
void qsort(int a[],int l,int r);	
void qsort(int a[],int l,int r)
{
	int x,y,i,j;
	x=a[(l+r)/2];
	i=l;j=r;
	while (i<=j)
	{
		while (a[i]<x) i++;	
		while (a[j]>x) j--;	
		if (i<=j)
		{
			y=a[i];a[i]=a[j];a[j]=y;
			y=tt[i];tt[i]=tt[j];tt[j]=y;
			y=hei[i];hei[i]=hei[j];hei[j]=y;
			i++;
			j--;
		}
	}
	if (l<j) qsort(a,l,j);
	if (i<r) qsort(a,i,r);
}
using namespace std;
int main()
{
	freopen("well.in","r",stdin);
	freopen("well.out","w",stdout);
	scanf("%d%d",&d,&n);
	for(int i=1;i<=n;i++)
	{
		scanf("%d%d%d",&t[i],&tt[i],&hei[i]);
	}
	qsort(t,1,n);
	for (int i=1;i<=n;i++)
	{
		sum[i]=sum[i-1]+t[i];
		sumh[i]=sumh[i-1]+hei[i];
	}
	for (int i=1;i<=n;i++)
	{
		ans+=tt[i];
	}
	ans-=t[n];
	printf("%d",ans+10);
	return 0;
}