/*
これを入れて実行
g++ code.cpp
./a.out
 */
 
#include <iostream>
#include <cstdio>
#include <stdio.h>
#include <vector>
#include <string>
#include <cstring>
#include <queue>
#include <deque>
#include <stack>
#include <algorithm>
#include <utility>
#include <set>
#include <map>
#include <unordered_map>
#include <unordered_set>
#include <cmath>
#include <math.h>
#include <tuple>
#include <iomanip>
#include <bitset>
#include <functional>
#include <cassert>
#include <random>

#define all(x) (x).begin(),(x).end()
#define rep(i, n) for (int i = 0; i < (int)(n); i++)
 
using namespace std;
typedef long long ll;
typedef long double ld;
 
int dy4[4] = {-1, 0, +1, 0};
int dx4[4] = {0, +1, 0, -1};
int dy8[8] = {-1, -1, 0, 1, 1, 1, 0, -1};
int dx8[8] = {0, 1, 1, 1, 0, -1, -1, -1};
 
const long long INF = 1LL << 60;
const ll MOD = 1e9 + 7;
 
bool greaterSecond(const pair<int, int>& f, const pair<int, int>& s){
    return f.second > s.second;
}
 
ll gcd(ll a, ll b){
	if (b == 0)return a;
	return gcd(b, a % b);
}
 
ll lcm(ll a, ll b){
    return a / gcd(a, b) * b;
}

ll conbinationMemo[100][100];

void cmemoInit(){
    rep(i, 100){
        rep(j, 100){
            conbinationMemo[i][j] = -1;
        }
    }
}
 
ll nCr(ll n, ll r){
    if(conbinationMemo[n][r] != -1) return conbinationMemo[n][r];
    if(r == 0 || r == n){
        return 1;
    } else if(r == 1){
        return n;
    }
    return conbinationMemo[n][r] = (nCr(n - 1, r) + nCr(n - 1, r - 1));
}
 
ll nPr(ll n, ll r){
    r = n - r;
    ll ret = 1;
    for (ll i = n; i >= r + 1; i--) ret *= i;
    return ret;
}
//-----------------------ここから-----------
ll mod = 998244353;
ll pw10[200200];
ll sum10[200200];
ll sum(ll l, ll r){
    ll res = (sum10[r] - sum10[l]) % mod;
    while(res < 0) res += mod;
    return res % mod;
}
struct LazySegmentTree{
    ll segTreeSize = 1;
    vector<ll> node;
    vector<ll> lazy;
    vector<bool> lazyf;

    void init(vector<ll> vec){
        while(segTreeSize < (ll)vec.size()){
            segTreeSize *= 2;
        }
        node.resize(2 * segTreeSize - 1, 0);
        lazy.resize(2 * segTreeSize - 1, 0);
        lazyf.resize(2 * segTreeSize - 1, false);

        for(ll i = 0; i < (ll)vec.size(); i++){
            node[i + segTreeSize - 1] = vec[i];
        }
        for(ll i = segTreeSize - 2; i >= 0; i--){
            node[i] = node[2 * i + 1] + node[2 * i + 2] % mod;
        }
    }


    void eval(ll idx, ll l, ll r){
        if(lazyf[idx]){
            node[idx] = sum(l, r) * lazy[idx] % mod;
            if(r - l > 1){
                lazy[2*idx+1] = lazy[idx];
                lazy[2*idx+2] = lazy[idx];
                lazyf[2*idx+1] = true;
                lazyf[2*idx+2] = true;
            }
            lazyf[idx] = false;
            lazy[idx] = 0;
        }
    }

    void update(ll l, ll r, ll val, ll idx = 0, ll nowl = 0, ll nowr = -1){
        if(nowr < 0) nowr = segTreeSize;

        eval(idx, nowl, nowr);

        if(r <= nowl || nowr <= l) return;

        if(l <= nowl && nowr <= r){
            //lazy[idx] = (nowr - nowl) * val;
            lazy[idx] = val;
            lazyf[idx] = true;
            eval(idx, nowl, nowr);
        } else {
            update(l, r, val, 2*idx+1, nowl, (nowl+nowr)/2);
            update(l, r, val, 2*idx+2, (nowl + nowr) / 2, nowr);
            node[idx] = node[2*idx+1] + node[2*idx+2];
        }
    }

    ll get(ll l, ll r, ll idx = 0, ll nowl = 0, ll nowr = -1){
        if(nowr < 0) nowr = segTreeSize;
        if(r <= nowl || nowr <= l) return 0;

        eval(idx, nowl, nowr);
        if(l <= nowl && nowr <= r){
            return node[idx];
        }
        ll res = get(l, r, 2*idx+1, nowl, (nowl + nowr)/2) + get(l, r, 2*idx+2, (nowl + nowr)/2, nowr);
        res %= mod;
        return res;
    }
};
ll modpow(ll a, ll b){
    ll res = 1;
    while(b > 0){
        if(b & 1){
            res *= a;
            res %= mod;
        }
        a *= a;
        a %= mod;
        b >>= 1;
    }
    return res;
}
int main(void){
    ll p10 = 1;
    ll p9 = 1;
    rep(i, 200200){
        pw10[i] = p10;
        p10 *= 10;
        p10 %= mod;
    }
    rep(i, 200100){
        sum10[i + 1] = sum10[i] + pw10[i];
        sum10[i + 1] %= mod;
    }

    ll n, q;
    cin >> n >> q;
    vector<ll> L(q), R(q), D(q);
    rep(i, q){
        cin >> L[i] >> R[i] >> D[i];
        L[i]--;
        R[i]--;
    }
    vector<ll> a(n);
    rep(i, n){
        a[i] = pw10[i];
    }

    LazySegmentTree sgt;
    sgt.init(a);

    rep(i, q){
        ll l = n - R[i] - 1;
        ll r = n - L[i] - 1;
        sgt.update(l, r + 1, D[i]);
        cout << sgt.get(0, n) << endl;
    }
}



Measured memory_bytes: 22544