#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <exception>
#include <fstream>
#include <functional>
#include <iomanip>
#include <ios>
#include <iosfwd>
#include <iostream>
#include <istream>
#include <iterator>
#include <limits>
#include <list>
#include <locale>
#include <map>
#include <memory>
#include <new>
#include <numeric>
#include <ostream>
#include <queue>
#include <set>
#include <sstream>
#include <stack>
#include <stdexcept>
#include <streambuf>
#include <string>
#include <typeinfo>
#include <utility>
#include <valarray>
#include <vector>
#include <climits>
#include <cstring>
#include <cassert>
#include <atcoder/lazysegtree.hpp>


using namespace std;
using namespace atcoder;

#define REP(i, n) for (int i=0; i<(n); ++i)
#define RREP(i, n) for (int i=(int)(n)-1; i>=0; --i)
#define FOR(i, a, n) for (int i=(a); i<(n); ++i)
#define RFOR(i, a, n) for (int i=(int)(n)-1; i>=(a); --i)

#define SZ(x) ((int)(x).size())
#define ALL(x) (x).begin(),(x).end()

#define DUMP(x) cerr<<#x<<" = "<<(x)<<endl
#define DEBUG(x) cerr<<#x<<" = "<<(x)<<" (L"<<__LINE__<<")"<<endl;

template<class T>
ostream &operator<<(ostream &os, const vector<T> &v) {
    os << "[";
    REP(i, SZ(v)) {
        if (i) os << ", ";
        os << v[i];
    }
    return os << "]";
}

template<class T, class U>
ostream &operator<<(ostream &os, const pair<T, U> &p) {
    return os << "(" << p.first << " " << p.second << ")";
}

template<class T>
bool chmax(T &a, const T &b) {
    if (a < b) {
        a = b;
        return true;
    }
    return false;
}

template<class T>
bool chmin(T &a, const T &b) {
    if (b < a) {
        a = b;
        return true;
    }
    return false;
}

using ll = long long;
using ull = unsigned long long;
using ld = long double;
using P = pair<int, int>;
using vi = vector<int>;
using vll = vector<ll>;
using vvi = vector<vi>;
using vvll = vector<vll>;

const ll MOD = 998244353;
const int INF = INT_MAX / 2;
const ll LINF = LLONG_MAX / 2;
const ld eps = 1e-9;


// edit

vector<ll> one, ten;

struct S {
    ll x;
    int len;
};

using F = int;


S op(S l, S r) {
    return {(l.x * ten[r.len] + r.x) % MOD, l.len + r.len};
}

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

S mapping(F f, S s) {
    if (f == 0) return s;
    return {one[s.len] * f % MOD, s.len};
}

F composition(F f1, F f2) {
    if (f1 == 0) return f2;
    return f1;
}

F id() {
    return 0;
}


void solve() {
    int n, q;
    cin >> n >> q;

    one.push_back(0);
//    ten.push_back(0);
    one.push_back(1);
    ten.push_back(1);

    for (int i = 0; i <= n; ++i) {
        ll lt = ten.back() * 10 % MOD;
        ten.push_back(lt);
        ll lo = (one.back() * 10 + 1) % MOD;
        one.push_back(lo);
    }

    lazy_segtree<S, op, e, F, mapping, composition, id> seg(n);

    for (int i = 0; i < n; ++i) {
        seg.set(i, {1, 1});
    }
    while (q--) {
        int L, R, D;
        cin >> L >> R >> D;
        L--;
        seg.apply(L, R, D);
        auto avl = seg.all_prod();
        cout << avl.x << endl;
    }

}


int main() {
    cin.tie(0);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
//    std::ifstream in("input.txt");
//    std::cin.rdbuf(in.rdbuf());

    solve();


    return 0;
}


Measured memory_bytes: 18428