#include <bits/stdc++.h>
#include <atcoder/all>
using namespace std;

#define NDEBUG
#include <cassert>


typedef long long ll;
typedef long double Double;
typedef unsigned long long ull;
typedef pair<int, int> ii;
typedef pair<ll, ll> llll;
typedef pair<double, double> dd;

typedef vector<int> vi;
typedef vector<vector<int>> vvi;
typedef vector<ii> vii;
typedef vector<vector<ii>> vvii;
typedef vector<ll> vll;
typedef vector<vector<ll>> vvll;
typedef vector<llll> vllll;
typedef vector<bool> vb;
typedef vector<string> vs;
typedef vector<double> vd;
typedef vector<long double> vD;

#define sz(a) int((a).size())
#define pb push_back
#define eb emplace_back
#define FOR(var, from, to) for (int var = (from); var <= (to); ++var)
#define rep(var, n) for (int var = 0; var < (n); ++var)
#define rep1(var, n) for (int var = 1; var <= (n); ++var)
#define repC2(vari, varj, n)                 \
    for (int vari = 0; vari < (n)-1; ++vari) \
        for (int varj = vari + 1; varj < (n); ++varj)
#define repC3(vari, varj, vark, n)                      \
    for (int vari = 0; vari < (n)-2; ++vari)            \
        for (int varj = vari + 1; varj < (n)-1; ++varj) \
            for (int vark = varj + 1; vark < (n); ++vark)
#define ALL(c) (c).begin(), (c).end()
#define RALL(c) (c).rbegin(), (c).rend()
#define tr(i, c) for (auto i = (c).begin(); i != (c).end(); ++i)
#define found(s, e) ((s).find(e) != (s).end())
#define mset(arr, val) memset(arr, val, sizeof(arr))
#define mid(x, y) ((x) + ((y) - (x)) / 2)
#define IN(x, a, b) ((a) <= (x) && (x) <= (b))
#define cons make_pair
#define clamp(v, lo, hi) min(max(v, lo), hi)
#define ABS(x) max((x), -(x))
#define PQ(T) priority_queue<T, vector<T>, greater<T>>

template <typename T1, typename T2>
inline void amin(T1& a, T2 const& b) {
    if (a > b) a = b;
}
template <typename T1, typename T2>
inline void amax(T1& a, T2 const& b) {
    if (a < b) a = b;
}
template <typename X, typename T>
auto vectors(X x, T a) {
    return vector<T>(x, a);
}
template <typename X, typename Y, typename Z, typename... Zs>
auto vectors(X x, Y y, Z z, Zs... zs) {
    auto cont = vectors(y, z, zs...);
    return vector<decltype(cont)>(x, cont);
}

inline ll square(ll x) { return x * x; }
inline ll gcd(ll a, ll b) {
    while (a) swap(a, b %= a);
    return b;
}
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
template <typename T>
inline T mod(T a, T b) {
    return ((a % b) + b) % b;
}

template <typename T>
int find_left(vector<T>& v, T elem) {
    return (int)(upper_bound(v.begin(), v.end(), elem) - v.begin()) - 1;
}
template <typename T>
int find_right(vector<T>& v, T elem) {
    return (int)(lower_bound(v.begin(), v.end(), elem) - v.begin());
}

const ll MOD = 998244353LL;

using mint = atcoder::modint998244353;

ll p[200010], q[200010];

using S = pair<mint, int>;
S op(S a, S b) {
    mint base = p[b.second];

    S ans(a.first * base + b.first, a.second + b.second);
    return ans;
}
S e() { return S(0, 0); }

using F = pair<int, int>;
S mapping(F f, S x) {
    mint iii = q[x.second];
    S ans(x.first * f.first + iii * f.second, x.second);
    return ans;
}
F composition(F f, F g) {
    F ans = (f.second == 0) ? g : f;
    return ans;
}
F id() { return F(1, 0); }

int main() {
    p[0] = 1;
    q[0] = 0;
    p[1] = 10;
    q[1] = 1;

    for (int i = 2; i <= 200002; ++i) {
        p[i] = (p[i - 1] * 10) % MOD;
        q[i - 1] = (p[i - 2] + q[i - 2]) % MOD;
    }

    int N, Q;
    scanf("%d %d%*c", &N, &Q);
    vector<S> a(N, S(1, 1));
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> seg(a);

    rep(i, Q) {
        int l, r, d;
        scanf("%d %d %d%*c", &l, &r, &d);
        --l;
        seg.apply(l, r, F(0, d));
        S s = seg.all_prod();
        printf("%d\n", s.first.val());
    }

    return 0;
}


Measured memory_bytes: 14132