/* Problem URL: https://codeforces.com/contest/915/problem/E */

/*
 * TODO: Finish the problem
 */

#include <bits/stdc++.h>
#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>

using namespace std;
using namespace __gnu_pbds;

template <class T, class comp = less<>>
using ordered_set = tree<T, null_type , comp , rb_tree_tag , tree_order_statistics_node_update>;

#define V vector

#define rmin(a, b) a = min(a, b)
#define rmax(a, b) a = max(a, b)

#define rep(i, lim) for (int i = 0; i < (lim); i++)
#define nrep(i, s, lim) for (int i = s; i < (lim); i++)

#define repv(i, v) for (auto &i : (v))
#define fillv(v) for (auto &itr_ : (v)) { cin >> itr_; }
#define sortv(v) sort(v.begin(), v.end())
#define all(v) (v).begin(), (v).end()

using vi = vector<int>;
using vvi = vector<vi>;
using vvvi = vector<vvi>;
using vvvvi = vector<vvvi>;

using ll = long long;

using vl = vector<ll>;
using vvl = vector<vl>;
using vvvl = vector<vvl>;
using vvvvl = vector<vvvl>;

template<class v>
auto operator<<(ostream &os, const vector<v> &vec)->ostream& {
    os << vec[0];
    for (size_t i = 1; i < vec.size(); i++) {
        os << ' ' << vec[i];
    }
    os << '\n';
    return os;
}

template<class v>
auto operator>>(istream &is, vector<v> &vec)->istream& {
    for (auto &i : vec) {
        is >> i;
    }
    return is;
}

template<class v>
auto operator<<(ostream &os, const vector<vector<v>> &vec)->ostream& {
    for (auto &i : vec) {
        os << i[0];
        for (size_t j = 1; j < i.size(); j++) {
            os << ' ' << i[j];
        }
        os << '\n';
    }
    return os;
}

template<class v>
auto operator>>(istream  &is, vector<vector<v>> &vec)->istream& {
    for (auto &i : vec) {
        for (auto &j : i) {
            is >> j;
        }
    }
    return is;
}

int main()
{
    ios::sync_with_stdio(false);
    cin.tie(nullptr);

    int n, q;
    cin >> n >> q;

    set<pair<int, int>> var;

    ll ans = 0;

    while (q--) {
        int l, r, k;
        cin >> l >> r >> k;

        auto itr = var.lower_bound({l, 0});

        while (itr != var.end() && itr->second <= r) {
            ans -= itr->first - itr->second + 1;
            int lone = itr->second;
            int rone = min(l - 1, itr->first);

            if (lone <= rone) {
                ans += rone - lone + 1;
                var.emplace(rone, lone);
            }

            int ltwo = max(itr->second, r + 1);
            int rtwo = itr->first;

            if (ltwo <= rtwo) {
                ans += rtwo - ltwo + 1;
                var.emplace(rtwo, ltwo);
            }

            itr = var.erase(itr);
        }

        if (k == 1) {
            ans += r - l + 1;
            var.emplace(r, l);
        }

        cout << n - ans << '\n';
    }
}