#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

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);
}

vector<vector<mint>> sum;

class SqrtDiv {
private:
    vector<int> nodes;
    vector<int> blocks;
    vector<bool> updated;
    vector<mint> blocks_sum;

public:
    SqrtDiv(int n) {
        int nb = 1;
        nodes.resize(n, 0);
        while (nb * nb < n) {
            nb++;
        }
        blocks.resize(nb, 0);
        updated.resize(nb, false);
        blocks_sum.resize(nb, 0_m);
    }
    // [l, r), 0-indexed
    void update(int l, int r, int val) {
        int nb = blocks.size();
        int n = nodes.size();
        int blen = (n + nb - 1) / nb;

        int lb = l / blen, rb = (r + blen - 1) / blen;
        for (int b = lb; b < rb; b++) {
            int nl = b * blen, nr = min((b + 1) * blen, n);
            if (l <= nl && nr <= r) {
                updated[b] = true;
                blocks[b] = val;
                blocks_sum[b] = sum[val][nr] - sum[val][nl];
            } else {
                if (updated[b]) {
                    updated[b] = false;
                    for (int t = nl; t < nr; t++) {
                        nodes[t] = blocks[b];
                    }
                }
                for (int t = max(nl, l); t < min(nr, r); t++) {
                    nodes[t] = val;
                }
                blocks_sum[b] = 0_m;
                for (int t = nl; t < nr; t++) {
                    blocks_sum[b] += sum[nodes[t]][t + 1] - sum[nodes[t]][t];
                }
            }
        }
    }
    mint query(int l, int r) {
        mint ans = 0_m;
        int nb = blocks.size();
        int n = nodes.size();
        int blen = (n + nb - 1) / nb;

        int lb = l / blen, rb = (r + blen - 1) / blen;
        for (int b = lb; b < rb; b++) {
            int nl = b * blen, nr = min((b + 1) * blen, n);
            if (l <= nl && nr <= r) {
                ans += blocks_sum[b];
            } else {
                if (updated[b]) {
                    updated[b] = false;
                    for (int t = nl; t < nr; t++) {
                        nodes[t] = blocks[b];
                    }
                    blocks_sum[b] = 0_m;
                    for (int t = nl; t < nr; t++) {
                        blocks_sum[b] += sum[nodes[t]][t + 1] - sum[nodes[t]][t];
                    }
                }
                for (int t = max(nl, l); t < min(nr, r); t++) {
                    ans += sum[nodes[t]][t + 1] - sum[nodes[t]][t];
                }
            }
        }
        return ans;
    }
};

int main() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    int n, q;
    cin, n, q;
    sum = make_v(10, n + 1, 0_m);
    REP(i, 1, 10) {
        REP(j, 0, n) {
            sum[i][j + 1] = sum[i][j] * 10 + i;
        }
    }
    SqrtDiv sq(n);
    sq.update(0, n, 1);
    REP(i, 0, q) {
        int l, r, d;
        cin, l, r, d;
        l = n - l;
        r = n - r;
        swap(l, r);
        sq.update(l, r + 1, d);
        print(sq.query(0, n));
    }
    return 0;
}


Measured memory_bytes: 20372