#include <bits/stdc++.h>
using namespace std;
const int P = 1e9 + 7, INF = 0x3f3f3f3f;
long long gcd(long long a, long long b) { return b ? gcd(b, a % b) : a; }
long long qpow(long long a, long long n) {
  long long r = 1 % P;
  for (a %= P; n; a = a * a % P, n >>= 1)
    if (n & 1) r = r * a % P;
  return r;
}
long long inv(long long first) {
  return first <= 1 ? 1 : inv(P % first) * (P - P / first) % P;
}
inline int rd() {
  int first = 0;
  char p = getchar();
  while (p < '0' || p > '9') p = getchar();
  while (p >= '0' && p <= '9') first = first * 10 + p - '0', p = getchar();
  return first;
}
const int N = 1e6 + 50;
int n, q, b[N];
struct {
  int l, r, k;
} e[N];
long long sum[N << 2];
void build(int o, int l, int r) {
  if (l == r) return sum[o] = b[r + 1] - b[l], void();
  build((o << 1), l, ((l + r) >> 1)),
      build(((o << 1) | 1), ((l + r) >> 1) + 1, r),
      sum[o] = sum[(o << 1)] + sum[((o << 1) | 1)];
}
void add(int o, int l, int r, int ql, int qr, int v) {
  if (ql <= l && r <= qr) {
    if (v == 1)
      sum[o] = 0;
    else
      sum[o] = b[r + 1] - b[l];
    return;
  }
  if (sum[o] == b[r + 1] - b[l]) {
    sum[(o << 1)] = b[((l + r) >> 1) + 1] - b[l];
    sum[((o << 1) | 1)] = b[r + 1] - b[((l + r) >> 1) + 1];
  }
  if (!sum[o]) sum[(o << 1)] = sum[((o << 1) | 1)] = 0;
  if (((l + r) >> 1) >= ql) add((o << 1), l, ((l + r) >> 1), ql, qr, v);
  if (((l + r) >> 1) < qr)
    add(((o << 1) | 1), ((l + r) >> 1) + 1, r, ql, qr, v);
  sum[o] = sum[(o << 1)] + sum[((o << 1) | 1)];
}
int main() {
  scanf("%d%d", &n, &q);
  b[++*b] = 1, b[++*b] = n + 1;
  for (int i = 1; i <= q; ++i) {
    scanf("%d%d%d", &e[i].l, &e[i].r, &e[i].k);
    b[++*b] = e[i].l;
    b[++*b] = ++e[i].r;
  }
  sort(b + 1, b + 1 + *b);
  *b = unique(b + 1, b + 1 + *b) - b - 1;
  build(1, 1, *b - 1);
  for (int i = 1; i <= q; ++i) {
    int l = lower_bound(b + 1, b + 1 + *b, e[i].l) - b;
    int r = lower_bound(b + 1, b + 1 + *b, e[i].r) - b - 1;
    add(1, 1, *b - 1, l, r, e[i].k);
    printf("%lld\n", sum[1]);
  }
}
