#include <iostream>
#include <vector>
#include <algorithm>
#include <string>
#include <numeric>
#include <utility>
#include <tuple>

#define REP(i, a, b) for (int i = int(a); i < int(b); i++)
using namespace std;
using ll = long long int;
using P = pair<ll, ll>;

// clang-format off
#ifdef _DEBUG_
#define dump(...) do{ cerr << __LINE__ << ":\t" << #__VA_ARGS__ << " = "; PPPPP(__VA_ARGS__); cerr << endl; } while(false)
template<typename T> void PPPPP(T t) { cerr << t; }
template<typename T, typename... S> void PPPPP(T t, S... s) { cerr << t << ", "; PPPPP(s...); }
#else
#define dump(...) do{ } while(false)
#endif
template<typename T> vector<T> make_v(size_t a, T b) { return vector<T>(a, b); }
template<typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v(ts...))>(a, make_v(ts...)); }
template<typename T> bool chmin(T &a, T b) { if (a > b) {a = b; return true; } return false; }
template<typename T> bool chmax(T &a, T b) { if (a < b) {a = b; return true; } return false; }
template<typename T> void print(T a) { cout << a << endl; }
template<typename T, typename... Ts> void print(T a, Ts... ts) { cout << a << ' '; print(ts...); }
template<typename T> istream &operator,(istream &in, T &t) { return in >> t; }
// clang-format on

#include <atcoder/lazysegtree>

template<ll MOD = 1000000007>
class ModInt {
    ll n;
    ModInt constexpr inverse() const {
        return ModInt::pow(*this, MOD - 2);
    }

public:
    ModInt()
        : n(0) {}
    ModInt(ll _n)
        : n(((_n % MOD) + MOD) % MOD) {}
    ModInt operator+=(const ModInt &m) {
        n += m.n;
        if (n >= MOD) n -= MOD;
        return *this;
    }
    ModInt operator-=(const ModInt &m) {
        n -= m.n;
        if (n < 0) n += MOD;
        return *this;
    }
    ModInt operator*=(const ModInt &m) {
        n *= m.n;
        if (n >= MOD) n %= MOD;
        return *this;
    }
    ModInt operator/=(const ModInt &m) {
        (*this) *= m.inverse();
        return *this;
    }
    friend ModInt operator+(ModInt t, const ModInt &m) {
        return t += m;
    }
    friend ModInt operator-(ModInt t, const ModInt &m) {
        return t -= m;
    }
    friend ModInt operator*(ModInt t, const ModInt &m) {
        return t *= m;
    }
    friend ModInt operator/(ModInt t, const ModInt &m) {
        return t /= m;
    }
    ModInt operator=(const ll l) {
        n = l % MOD;
        if (n < 0) n += MOD;
        return *this;
    }
    friend ostream &operator<<(ostream &out, const ModInt &m) {
        out << m.n;
        return out;
    }
    friend istream &operator>>(istream &in, ModInt &m) {
        ll l;
        in >> l;
        m = l;
        return in;
    }
    static constexpr ModInt pow(const ModInt x, ll p) {
        ModInt<MOD> ans = 1;
        for (ModInt<MOD> m = x; p > 0; p /= 2, m *= m) {
            if (p % 2) ans *= m;
        }
        return ans;
    }
};
using mint = ModInt<998244353>;
mint operator"" _m(unsigned long long m) {
    return mint(m);
}

struct S {
    mint s;
    int l, r;
    S(mint _s, int _l, int _r)
        : s(_s), l(_l), r(_r) {}
    S()
        : S(0_m, 0, 0) {}
};

S op(S a, S b) {
    return S(a.s + b.s, min(a.l, b.l), max(a.r, b.r));
}

const int SZ = 200020;

S e() {
    return S(0_m, SZ, 0);
}

struct F {
    int idx;
    int val;
    F(int _idx, int _val)
        : idx(_idx), val(_val) {}
    F()
        : idx(0), val(0) {}
};

vector<vector<mint>> sum;

S mapping(F f, S s) {
    if (f.val == 0) {
        return s;
    } else {
        return S(sum[f.val][s.l] - sum[f.val][s.r], s.l, s.r);
    }
}

F composition(F f1, F f2) {
    return f1.idx < f2.idx ? f2 : f1;
}

F id() {
    return F(-1, 0);
}

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin, n, q;
    vector<S> init(n);
    {
        mint pow10 = 1;
        REP(i, 0, n) {
            init[n - i - 1] = S(pow10, n - i - 1, n - i);
            pow10 *= 10;
        }
    }
    atcoder::lazy_segtree<S, op, e, F, mapping, composition, id> s(init);
    sum = make_v(10, n + 1, 0_m);
    REP(i, 1, 10) {
        REP(j, 0, n) {
            sum[i][n - j - 1] = sum[i][n - j] * 10 + i;
        }
    }

    REP(i, 0, q) {
        int l, r, d;
        cin, l, r, d;
        s.apply(l - 1, r, F(i, d));
        print(s.all_prod().s);
    }

    return 0;
}


Measured memory_bytes: 33816