#include <bits/stdc++.h>
using namespace std;
inline long long read() {
  long long x = 0, f = 1;
  char ch = getchar();
  while (ch < '0' || ch > '9') {
    if (ch == '-') f = -1;
    ch = getchar();
  }
  while (ch >= '0' && ch <= '9') {
    x = (x << 1) + (x << 3) + ch - '0';
    ch = getchar();
  }
  return x * f;
}
int n, q, ans;
struct node {
  int l, r;
  mutable int val;
  inline node(int L, int R = -1, int val = 0) : l(L), r(R), val(val) {}
  inline bool operator<(const node &T) const { return l < T.l; }
};
std::set<node> s;
inline std::set<node>::iterator split(int p) {
  std::set<node>::iterator it = s.lower_bound(node(p));
  if (it != s.end() && it->l == p) return it;
  --it;
  int L = it->l, R = it->r, val = it->val;
  s.erase(it);
  s.insert(node(L, p - 1, val));
  return s.insert(node(p, R, val)).first;
}
inline void assign(int l, int r, int val) {
  std::set<node>::iterator itr = split(r + 1), itl = split(l);
  for (std::set<node>::iterator it = itl; it != itr; ++it)
    ans -= it->val * (it->r - it->l + 1);
  s.erase(itl, itr);
  s.insert(node(l, r, val));
  ans += val * (r - l + 1);
}
int main() {
  ans = n = read(), q = read();
  s.insert(node(1, n, 1));
  s.insert(node(n + 1, n + 1, 0));
  while (q--) {
    int l = read(), r = read(), k = read() - 1;
    assign(l, r, k);
    printf("%d\n", ans);
  }
  return 0;
}
