#include <bits/stdc++.h>
#define FOR(i,n) for(int i=0;i<(int)(n);i++)
#define FORR(i,m,n) for(int i=(int)(m);i<(int)(n);i++)
#define pb(a) push_back(a)
#define mp(x,y) make_pair(x,y)
#define ALL(a) a.begin(),a.end()
#define ZERO(a) memset(a,0,sizeof(a))
#define MINUS(a) memset(a,-1,sizeof(a))
#define len(a) sizeof(a)
#define ll long long
#define pii pair<int,int>
#define INF 1<<29
#define MAX 
using namespace std;

int n,m,a,b,x;
vector<vector<int>> imos;

void solve(){
 scanf("%d%d",&n,&m);
 imos.resize(n+2);
 FOR(i,n+2) imos[i].assign(i+2,0);
 FOR(i,m){
  scanf("%d%d%d",&a,&b,&x);
  a--; b--;
  imos[a][b]++;
  imos[a][b+1]--;
  imos[a+x+1][b]--;
  imos[a+x+2][b+1]++;
  imos[a+x+1][b+x+2]++;
  imos[a+x+2][b+x+2]--;
 }
 FOR(i,n) FOR(j,i+1) imos[i][j+1]+=imos[i][j];
 FOR(i,n) FOR(j,i+1) imos[i+1][j]+=imos[i][j];
 FOR(i,n) FOR(j,i+1) imos[i+1][j+1]+=imos[i][j];
 int ct=0;
 FOR(i,n) FOR(j,i+1) if(imos[i][j]) ct++;
 printf("%d\n",ct);
}

int main(){
 solve();
 return 0;
}