#include <bits/stdc++.h>
using namespace std;
inline int read() {
  int 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 * 10 + (ch ^ 48);
    ch = getchar();
  }
  return x * f;
}
const int N = 300010;
int n, q, x, y, z, d[N * 50], f[N * 50], ls[N * 50], rs[N * 50], tot, rt;
inline void pushup(int p) { d[p] = d[ls[p]] + d[rs[p]]; }
inline void upd(int p, int l, int r, int x) {
  d[p] = x * (r - l + 1);
  f[p] = x;
}
inline void pushdown(int p, int l, int r) {
  if (f[p]) {
    int mid = l + r >> 1;
    if (!ls[p]) ls[p] = ++tot;
    upd(ls[p], l, mid, f[p]);
    if (!rs[p]) rs[p] = ++tot;
    upd(rs[p], mid + 1, r, f[p]);
    f[p] = 0;
  }
}
inline void change(int &p, int l, int r, int x, int y, int z) {
  if (!p) p = ++tot;
  if (x <= l && r <= y) {
    upd(p, l, r, z);
    return;
  }
  pushdown(p, l, r);
  int mid = l + r >> 1;
  if (x <= mid) change(ls[p], l, mid, x, y, z);
  if (y > mid) change(rs[p], mid + 1, r, x, y, z);
  pushup(p);
}
int main() {
  n = read();
  q = read();
  memset(f, -1, sizeof(f));
  change(rt, 1, n, 1, n, 2);
  while (q--) {
    x = read();
    y = read();
    z = read();
    change(rt, 1, n, x, y, z);
    printf("%d\n", d[1] - n);
  }
  return 0;
}
