#include <iostream>
#include <vector>
#include <queue>
#include <algorithm>
#include <map>
#include <set>
#include <unistd.h>
#include <stdlib.h>
#include <atcoder/lazysegtree>

using namespace std;
using namespace atcoder;

// using mint = long double;
// using mint = modint998244353;
// using mint = modint1000000007;

typedef long long ll;
typedef pair<ll, ll> P;
typedef pair<P, ll> T;

const ll INF = 2e18;
const ll fact_table = 3200008;

priority_queue <ll> pql;
priority_queue <P> pqp;
//big priority queue
priority_queue <ll, vector<ll>, greater<ll> > pqls;
priority_queue <P, vector<P>, greater<P> > pqps;
//small priority queue
//top pop

ll dx[8] = {1, 0, -1, 0, 1, 1, -1, -1};
ll dy[8] = {0, 1, 0, -1, 1, -1, -1, 1};
//↓,→,↑,←

/*
#define endl "\n"
#ifdef ENJAPMA
#undef endl
#endif
*/

#define p(x) cout<<x<<endl;
#define el cout<<endl;
#define pe(x) cout<<x<<" ";
#define ps(x) cout<<fixed<<setprecision(25)<<x<<endl;
#define pu(x) cout<<(x);
#define pb push_back
#define lb lower_bound
#define ub upper_bound
#define CLEAR(a) a = decltype(a)();
#define pc(x) cout << x << ",";
#define rep(i, n) for (ll i = 0; i < (n); i ++)

typedef vector<ll> vec;
typedef vector<vector<ll>> mat;

const ll mod = 998244353ll;
// const ll mod = 1000000007ll;

ll mypow(ll a, ll b, ll m = mod) {ll x = 1; while (b) {while (!(b & 1)) {(a *= a) %= m; b >>= 1;}(x *= a) %= m; b--;} return x;}
vec readvec(ll read) { vec res(read); for (int i = 0; i < read; i++) { cin >> res[i]; } return res;}
void YES(bool cond) { if (cond) { p("YES");} else { p("NO");} return;}
void Yes(bool cond) { if (cond) { p("Yes");} else { p("No");} return;}
void line() { p("--------------------"); return;}

/*
ll fact[fact_table + 5], rfact[fact_table + 5];

void c3_init() {
    fact[0] = rfact[0] = 1;
    for (ll i = 1; i <= fact_table; i++) {
        fact[i] = (fact[i - 1] * i) % mod;
    }
    rfact[fact_table] = mypow(fact[fact_table], mod - 2, mod);
    for (ll i = fact_table; i >= 1; i--) {
        rfact[i - 1] = rfact[i] * i;
        rfact[i - 1] %= mod;
    }
    return;
}
ll c3(ll n, ll r) {
    return (((fact[n] * rfact[r]) % mod ) * rfact[n - r]) % mod;
}
*/

bool multicase = false;
ll ruiseki[500005];

P op(P a, P b){
    ll sa = a.first, sb = b.first;
    sa *= mypow(10ll, b.second, mod);
    sa %= mod;
    ll s = (sa + sb) % mod;
    return P(s, a.second + b.second);
}

P e(){
    return P(0ll, 1ll);
}

P mapping(ll f, P x){
    // f(x)
    if (f == 0) {
        return x;
    } else {
        return P((f * ruiseki[x.second]) % mod, x.second);
    }
}

ll composition(ll f, ll g){
    if (g == 0) {
        return f;
    } else if (f == 0) {
        return g;
    } else {
        return f;
    }
}

ll id(){
    return 0ll;
}


void solve() {
    ll n, q;
    cin >> n >> q;
    ruiseki[1] = 1;
    for(int i=2;i<=n;i++){
        ruiseki[i] = 10 * ruiseki[i-1] + 1;
        ruiseki[i] %= mod;
    }
    lazy_segtree<P, op, e, ll, mapping, composition, id> seg(vector<P>(n+10, P(1, 1)));
    for(int i=0;i<q;i++){
        ll l, r, d;
        cin >> l >> r >> d;
        seg.apply(l, r + 1, d);

        ll ans = seg.prod(1, n + 1).first;

        ans *= mypow(10ll, mod - 2, mod);
        ans %= mod;
        p(ans);
    }
    return;
}


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

    ll q, testcase = 1;
    if (multicase) {
        cin >> q;
    } else {
        q = 1;
    }
    while (q--) {
        // pu("Case ");pu("#");pu(testcase);pu(": ");
        solve();
        testcase++;
    }

    // solve();
    return 0;
}

Measured memory_bytes: 18256