//                                                  '-.-'
   //                                         ()      __.'.__
   //                                      .-:--:-.  |_______|
   //                               ()      \____/    \=====/
   //                               /\      {====}     )___(
   //                    (\=,      //\\      )__(     /_____\
   //    __    |'-'-'|  //  .\    (    )    /____\     |   |
   //   /  \   |_____| (( \_  \    )__(      |  |      |   |
   //   \__/    |===|   ))  `\_)  /____\     |  |      |   |
   //  /____\   |   |  (/     \    |  |      |  |      |   |
   //   |  |    |   |   | _.-'|    |  |      |  |      |   |
   //   |__|    )___(    )___(    /____\    /____\    /_____\
   //  (====)  (=====)  (=====)  (======)  (======)  (=======)
   //  }===={  }====={  }====={  }======{  }======{  }======={
   // (______)(_______)(_______)(________)(________)(_________)
   //
   // Credits :- Joan G. Stark
   //|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
   //|                      AUTHOR - KASPAROVIAN                                     |
   //|~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~~|
#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define frr(i,n) for(int i=0;i<(n);i++)
#define pb push_back
#define eb emplace_back
#define all(v) (v).begin(),(v).end()
#define fr first
#define sc second
#define mk make_pair
#define endl '\n'
#define MOD 998244353
#define in insert
#define sz(x) (ll)(x).size()
#define mem(a,b) memset(a,b,sizeof(a))
#define int long long
#define runtime() ((double)clock() / CLOCKS_PER_SEC) 
#define fast ios_base::sync_with_stdio(false);cin.tie(0);cout.tie(0)
using namespace std;
#define TRACE 
  
#ifdef TRACE 
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__) 
template <typename Arg1> 
void __f(const char* name, Arg1&& arg1){ 
    cerr << name << " : " << arg1 << endl; 
} 
template <typename Arg1, typename... Args> 
void __f(const char* names, Arg1&& arg1, Args&&... args){ 
    const char* comma = strchr(names + 1, ',');cerr.write(names, comma - names) << " : " << arg1<<" | ";__f(comma+1, args...); 
} 
#else 
#define trace(...) 
#endif 
typedef long long ll;
typedef vector<int> vi;
typedef vector<ll> vl;
typedef long double ld;
typedef pair<ll,ll> pl;
typedef pair<int,int> pi;
typedef pair<int,pi> ppi;
typedef vector<vi> graph;
template<class T> void mxi(T & a, const T & b) { a = max(a, b); }
template<class T> void mni(T & a, const T & b) { a = min(a, b); }
ld EPS=1e-9;
mt19937 RNG(chrono::steady_clock::now().time_since_epoch().count());  
#define SHUF(v) shuffle(all(v), RNG); 
// Use mt19937_64 for 64 bit random numbers. 
int pfs[200200];
void pre()
{
	pfs[0]=1;
	int run=1;
	for(int i=1;i<200200;i++)
	{
		run=(run*10)%MOD;
		pfs[i]=run;
		pfs[i]=(pfs[i]+pfs[i-1])%MOD;
	}
}
struct node{
	int sum,lazy;
};
node t[4*200200];
#define mid ((l+r)>>1)
void build(int id,int l,int r)
{
	if(l==r)
	{
		t[id].sum=(pfs[r]-(r?pfs[r-1]:0))%MOD;
		if(t[id].sum<MOD)t[id].sum+=MOD;
		t[id].lazy=0;
		return;
	}
	build(id<<1,l,mid); build(id<<1|1,mid+1,r);
	t[id].sum=(t[id<<1].sum+t[id<<1|1].sum)%MOD;
	t[id].lazy=0;
}
void push(int id,int l,int r)
{
	if(t[id].lazy)
	{
		t[id].sum=((pfs[r]-(l?pfs[l-1]:0))*(t[id].lazy))%MOD;
		if(t[id].sum<0)t[id].sum+=MOD;
		if(l!=r)
		{
			t[id<<1].lazy=t[id].lazy;
			t[id<<1|1].lazy=t[id].lazy;
		}
	}
	t[id].lazy=0;
}
void upd(int id,int l,int r,int lq,int rq,int dig)
{
	push(id,l,r);
	if(rq<l||r<lq)return ;
	else if(lq<=l&&rq>=r)
	{
		t[id].lazy=dig;
		push(id,l,r);
		return;
	}
	upd(id<<1,l,mid,lq,rq,dig); upd(id<<1|1,mid+1,r,lq,rq,dig);
	t[id].sum=(t[id<<1].sum+t[id<<1|1].sum)%MOD;
}
void solve()
{
  int n,q;
  cin>>n>>q;
  build(1,0,n-1);
  while(q--)
  {
  	int l,r,d;
  	cin>>l>>r>>d;
  	l=n-l,r=n-r;
  	swap(l,r);
  	upd(1,0,n-1,l,r,d);
  	cout<<t[1].sum<<endl;
  }

}
signed main()
{
  fast;
  int t,tab;
  t=1;
  tab=t;
  pre();
  while(t--)
  {
    //cout<<"Case #"<<(tab-t)<<": ";
    solve();
  }
  cerr<<runtime();
}
//APPROACHING A QUESTION
//+ Think of binary search (max of min etc also if n<=2*10^5)
//+ Think of common dp states (Even if it appears as maths but constraints are small)
//+ Check constraints
//+ Keep calm and enjoy the question
//+ Be sure to remove MOD from binpow (if needed)
//+ Try bidirectional analysis for constructive questions
//+ If given some sequence try thinking of prefix sums
//+ If constraints are too large maybe its simple maths
//+ In questions with binary operations think of bits independently and also the change pattern
//+ If two or more binary operations are given mostly there is a relation between them and an arithmatic operator

Measured memory_bytes: 13580