#include<bits/stdc++.h>
#define dd(x) cout<<#x<<" = "<<x<<" "
#define de(x) cout<<#x<<" = "<<x<<"\n"
#define sz(x) int(x.size())
#define All(x) x.begin(),x.end()
#define pb push_back
#define mp make_pair
#define fi first
#define se second
using namespace std;
typedef long long ll;
typedef long double ld;
typedef pair<int,int> P;
typedef priority_queue<int> BQ;
typedef priority_queue<int,vector<int>,greater<int> > SQ;
const int maxn=1e7+5e6+10,mod=1e9+7,INF=0x3f3f3f3f;
int sum[maxn],ls[maxn],rs[maxn],lazy[maxn],id,root;
void push_dw(int l,int r,int rt)
{
    if (lazy[rt]!=-1)
    {
        if (!ls[rt])
            ls[rt]=++id;
        if (!rs[rt])
            rs[rt]=++id;
        int lson=ls[rt],rson=rs[rt];
        int m=(l+r)>>1;
        lazy[lson]=lazy[rson]=lazy[rt];
        sum[lson]=lazy[rt]*(m-l+1);
        sum[rson]=lazy[rt]*(r-m);
        lazy[rt]=-1;
    }
}
void upd(int L,int R,int c,int l,int r,int& rt)
{
    if (!rt)
        rt=++id;
    if (L<=l&&r<=R)
    {
        lazy[rt]=c;
        sum[rt]=(r-l+1)*c;
        return;
    }
    push_dw(l,r,rt);
    int m=(l+r)>>1;
    if (L<=m)
        upd(L,R,c,l,m,ls[rt]);
    if (R>m)
        upd(L,R,c,m+1,r,rs[rt]);
    sum[rt]=sum[ls[rt]]+sum[rs[rt]];
}
int main()
{
    int n,q;
    cin>>n>>q;
    memset(lazy,-1,sizeof(lazy));
    for (int i=0;i<q;++i)
    {
        int l,r,ty;
        scanf("%d%d%d",&l,&r,&ty);
        upd(l,r,ty==1?1:0,1,n,root);
        printf("%d\n",n-sum[1]);
    }
    return 0;
}