// Author: Vinay Khilwani
// Language: C++

// @vok8: Codeforces, AtCoder, LeetCode, HackerEarth, TopCoder, Google, FB, CSES, Spoj, GitHub
// @vok_8: CodeChef, GFG
// @vok8_khilwani: HackerRank

// Never Stop Trying.
// Trying to be Better than Myself.

// while(true)
// {
//     if(AC)
//     {
//         break;
//     }
//     else if(Contest Over)
//     {
//         Try.
//         Check out Editorial.
//         Understand.
//         Find out your Mistake.
//         Learn the topic (if new).
//         Solve Problems on that topic (if new).
//         Upsolve that problem.
//         break;
//     }
//     else
//     {
//         Try.
//         Use Pen-Paper.
//         Find errors, edge cases, etc.
//         continue;
//     }
// }

// Optimizations
#pragma GCC optimize("O2")
#pragma GCC optimize("unroll-loops")
#pragma GCC target("avx2")
#pragma GCC optimize("Os")

// Libraries
#include <bits/stdc++.h>
using namespace std;
// #include <ext/pb_ds/assoc_container.hpp> 
// #include <ext/pb_ds/tree_policy.hpp> 
// using namespace __gnu_pbds;

// Debugging
#define dbg(a) cerr<<a<<"\n";
#define debug_a(a) for(auto x:a) {cerr<<x<<" ";} cerr<<"\n";
#define debug_b(a) for(auto x:a) {cerr<<"["<<x.first<<", "<<x.second<<"]"<<"\n";} cerr<<"\n";
#define debug_c(a) for(auto x:a) {debug_a(x)} cerr<<"\n";
#define debug_d(a) for(auto x:a) {debug_b(x)} cerr<<"\n";
#define debug_e(a) cerr<<"["<<a.first<<", "<<a.second<<"]"<<"\n";

// Defines
#define fast ios_base::sync_with_stdio(false); cout.tie(NULL); cin.tie(NULL);
#define loop(i,a,n) for(int i=a; i<n; i++)
#define rloop(i,a,n) for(int i=a; i>=n; i--)
#define fr(i,a,n,b) for(int i=a; i<n; i+=b)
#define rfr(i,a,n,b) for(int i=a; i>=n; i-=b)
#define IN cin>>
#define OUT cout<<
#define nl "\n"
#define sz(a) int(a.size())
#define all(a) (a).begin(),(a).end()
#define each(a,b) for(auto &a:b)
#define pb push_back
#define set_bits(a) __builtin_popcountll(a)
#define ar array
#define write(a) for(auto x:a) {OUT x<<" ";} OUT nl;
#define read(a) for(auto &x:a) {IN x;}
// #define oset tree<int,null_type,less<int>,rb_tree_tag,tree_order_statistics_node_update>
using ll=long long int;
using ld=long double;
using pll=pair<ll,ll>;
using pii=pair<int,int>;
using vll=vector<ll>;
using vi=vector<int>;
const ll mod=(ll)(1e9)+7LL;
const ll M=998244353LL;
const int dx[4]={1,0,-1,0};
const int dy[4]={0,1,0,-1};
const ld pi=acos(-1);

// General Functions
ll gcd(ll a, ll b)
{
    return (b?gcd(b,a%b):a);
}
ll P(ll B, ll power, ll modulo) //Fast Power
{
    ll ans=1LL;
    while(power>0LL)
    {
        if(power%2LL==1LL)
        {
            ans=(ans*B)%modulo;
        }
        B=(B*B)%modulo;
        power/=2LL;
    }
    return ans;
}
bool isPrime(ll n)
{
    if(n<=1LL)
    {
        return false;
    }
    if(n<=3LL)
    {
        return true;
    }
    if(n%2==0LL || n%3==0LL)
    {
        return false;
    }
    for(ll i=5LL; (i*i)<=n; i+=6LL)
    {
        if(n%i==0LL || n%(i+2LL)==0LL)
        {
            return false;
        }
    }
    return true;
}
void vok()
{
    fast
    #ifndef ONLINE_JUDGE
        freopen("input.txt","r",stdin);
        freopen("output.txt","w",stdout);
        freopen("error.txt","w",stderr);
    #endif
}

// Global Variables
const int mxN=int(2e5)+100;
ll seg[4*mxN];
ll lazy[4*mxN];
ll arr[10][mxN];
int d;

// Solver Function(s) 
void build(int node, int l, int r)
{
    lazy[node]=0;
    if(l==r)
    {
        seg[node]=1;
        return;
    }
    int mid=(l+r)/2;
    int n1=2*node+1;
    int n2=n1+1;
    build(n1,l,mid);
    build(n2,mid+1,r);
    ll val=seg[n1]*P(10,r-mid,M)%M;
    val+=seg[n2];
    val%=M;
    seg[node]=val;
}
void upd(int node, int l, int r, int rl, int rr)
{
    int mid=(l+r)/2;
    int n1=2*node+1;
    int n2=n1+1;
    int len=r-l+1;
    if(lazy[node])
    {
        if(l!=r)
        {
            lazy[n1]=lazy[n2]=lazy[node];
        }
        seg[node]=arr[lazy[node]][len];
        lazy[node]=0;
    }
    if(l>=rl && r<=rr)
    {
        seg[node]=arr[d][len];
        if(l!=r)
        {
            lazy[n1]=lazy[n2]=d;
        }
        return;
    }
    if(l>rr || r<rl)
    {
        return;
    }
    upd(n1,l,mid,rl,rr);
    upd(n2,mid+1,r,rl,rr);
    ll val=seg[n1]*P(10,r-mid,M)%M;
    val+=seg[n2];
    val%=M;
    seg[node]=val;
}
void solve()
{
    int n,q;
    IN n>>q;
    loop(i,0,10)
    {
        arr[i][0]=0;
        loop(j,1,n+1)
        {
            arr[i][j]=arr[i][j-1]*10%M;
            arr[i][j]+=(ll)(i);
            arr[i][j]%=M;
        }
    }
    build(0,0,n-1);
    while(q--)
    {   
        int l,r;
        IN l>>r>>d;
        l--, r--;
        upd(0,0,n-1,l,r);
        OUT seg[0]<<nl;
    }
}

// Main Function
int main()
{
    vok();
    int t=1;
    // IN t;
    while(t--)
    {
        solve();
    }
    return 0;
}

Measured memory_bytes: 27456