#include <bits/stdc++.h>
using namespace std;
#define rep(i, n) for(int i = 0; i < n; i++)
#define rep2(i, x, n) for(int i = x; i <= n; i++)
#define rep3(i, x, n) for(int i = x; i >= n; i--)
#define elif else if
#define sp(x) fixed << setprecision(x)
#define pb push_back
#define eb emplace_back
#define all(x) x.begin(), x.end()
#define sz(x) (int)x.size()
using ll = long long;
using pii = pair<int, int>;
using pil = pair<int, ll>;
using pli = pair<ll, int>;
using pll = pair<ll, ll>;
//const int MOD = 1000000007;
const int MOD = 998244353;
const int inf = (1<<30)-1;
const ll INF = (1LL<<60)-1;
const double pi = acos(-1.0);
const double EPS = 1e-10;
template<typename T> bool chmax(T &x, const T &y) {return (x < y)? (x = y, true) : false;};
template<typename T> bool chmin(T &x, const T &y) {return (x > y)? (x = y, true) : false;};

template<int mod>
struct Mod_Int{
    ll x;

    Mod_Int() : x(0) {}

    Mod_Int(ll y) : x(y >= 0 ? y % mod : (mod - (-y) % mod) % mod) {}

    Mod_Int &operator += (const Mod_Int &p){
        x = (x + p.x) % mod;
        return *this;
    }

    Mod_Int &operator -= (const Mod_Int &p){
        x = (x + mod - p.x) % mod;
        return *this;
    }

    Mod_Int &operator *= (const Mod_Int &p){
        x = (x * p.x) % mod;
        return *this;
    }

    Mod_Int &operator /= (const Mod_Int &p){
        *this *= p.inverse();
        return *this;
    }

    Mod_Int &operator ++ () {return *this += Mod_Int(1);}

    Mod_Int operator ++ (int){
        Mod_Int tmp = *this;
        ++*this;
        return tmp;
    }

    Mod_Int &operator -- () {return *this -= Mod_Int(1);}

    Mod_Int operator -- (int){
        Mod_Int tmp = *this;
        --*this;
        return tmp;
    }

    Mod_Int operator - () const {return Mod_Int(-x);}

    Mod_Int operator + (const Mod_Int &p) const {return Mod_Int(*this) += p;}

    Mod_Int operator - (const Mod_Int &p) const {return Mod_Int(*this) -= p;}

    Mod_Int operator * (const Mod_Int &p) const {return Mod_Int(*this) *= p;}

    Mod_Int operator / (const Mod_Int &p) const {return Mod_Int(*this) /= p;}

    bool operator == (const Mod_Int &p) const {return x == p.x;}

    bool operator != (const Mod_Int &p) const {return x != p.x;}

    Mod_Int inverse() const {
        assert(*this != Mod_Int(0));
        return pow(mod-2);
    }

    Mod_Int pow(ll k) const{
        Mod_Int now = *this, ret = 1;
        while(k){
            if(k&1) ret *= now;
            now *= now, k >>= 1;
        }
        return ret;
    }

    friend ostream &operator << (ostream &os, const Mod_Int &p){
        return os << p.x;
    }

    friend istream &operator >> (istream &is, Mod_Int &p){
        ll a;
        is >> a;
        p = Mod_Int<mod>(a);
        return is;
    }
};

using mint = Mod_Int<MOD>;

mint pw[200001];

template<typename T>
struct Node{
    const int l, r;
    T base, sum1, sum2;
    vector<T> v;

    void update(){
        sum1 = 0;
        rep2(i, l, r-1) sum1 += v[i-l]*pw[i];
    }

    Node(int l, int r) : l(l), r(r), base(1){
        sum2 = 0;
        rep2(i, l, r-1) v.pb(1), sum2 += pw[i];
        update();
    }

    void change(int a, int b, T x){
        if(a >= r || b <= l) return;
        if(a <= l && b >= r) {base = x, sum1 = x*sum2; return;}
        if(base != -1) rep2(i, l, r-1) v[i-l] = base;
        rep2(i, max(a, l), min(b, r)-1) v[i-l] = x;
        base = -1;
        update();
    }

    T query(int a, int b){
        if(a >= r || b <= l) return 0;
        if(a <= l && b >= r) return sum1;
        T ret = 0;
        rep2(i, max(a, l), min(b, r)-1){
            if(base != -1) ret += base*pw[i];
            else ret += v[i-l]*pw[i];
        }
        return ret;
    }
};

int main(){
    int N, Q;
    cin >> N >> Q;
    pw[0] = 1;
    rep(i, N) pw[i+1] = pw[i]*10;

    vector<Node<mint>> nodes;
    int n = 0;
    while(n*n < N) n++;
    rep(i, n){
        nodes.eb(min(N, n*i), min(N, n*(i+1)));
    }

    vector<mint> ans;

    while(Q--){
        int L, R; mint D;
        cin >> L >> R >> D;
        for(auto &e: nodes){
            e.change(N-R, N-L+1, D);
        }
        mint sum = 0;
        for(auto &e: nodes){
            sum += e.query(0, N);
        }
        ans.pb(sum);
    }

    for(auto &e: ans) cout << e << endl;
}

Measured memory_bytes: 8728