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

#include <ext/pb_ds/assoc_container.hpp>
#include <ext/pb_ds/tree_policy.hpp>
using namespace __gnu_pbds;

template<typename T> using ordered_set = tree<T, null_type, less<T>, rb_tree_tag, tree_order_statistics_node_update>;
template<typename T, typename U> using ordered_map = tree<T, U, less<T>, rb_tree_tag, tree_order_statistics_node_update>;

typedef long long ll;
typedef long double ld;
typedef double db;
typedef string str;

typedef pair<int,int> pii;
typedef pair<ll,ll> pll;

typedef vector<int> vi;
typedef vector<ll> vll;
typedef vector<pii> vpii;
typedef vector<pll> vpll;
typedef vector<str> vstr;

#define FOR(i,j,k,in) for(int i=(j); i < (k);i+=in)
#define FORD(i,j,k,in) for(int i=(j); i >=(k);i-=in)
#define REP(i,b) FOR(i,0,b,1)
#define REPD(i,b) FORD(i,b,0,1)
#define pb push_back 
#define mp make_pair
#define ff first
#define ss second
#define all(x) begin(x), end(x)
#define rsz resize 
#define MANY_TESTS int tcase; cin >> tcase; while(tcase--)
	
const double EPS = 1e-9;
const int MOD = 1e9+7; // 998244353;
const ll INFF = 1e18;
const int INF = 1e9;
const ld PI = acos((ld)-1);
const vi dy = {1, 0, -1, 0, -1, 1, 1, -1};
const vi dx = {0, 1, 0, -1, -1, 1, -1, 1};

#ifdef DEBUG
#define DBG if(1)
#else
#define DBG if(0)
#endif

#define dbg(x) cout << "(" << #x << " : " << x << ")" << endl;
// ostreams
template <class T, class U>
ostream& operator<<(ostream& out, const pair<T, U> &par) {out << "[" << par.first << ";" << par.second << "]"; return out;}
template <class T>
ostream& operator<<(ostream& out, const set<T> &cont) { out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template <class T, class U>
ostream& operator<<(ostream& out, const map<T, U> &cont) {out << "{"; for( const auto &x:cont) out << x << ", "; out << "}"; return out; }
template<class T>
ostream& operator<<(ostream& out, const vector<T> &v){ out << "[";  REP(i, v.size()) out << v[i] << ", ";  out << "]"; return out;}
// istreams
template<class T>
istream& operator>>(istream& in, vector<T> &v){ for(auto &x : v) in >> x; return in; }
template<class T, class U>
istream& operator>>(istream& in, pair<T, U> &p){ in >> p.ff >> p.ss; return in; }
//searches
template<typename T, typename U>
T bsl(T lo, T hi, U f){ hi++; T mid; while(lo < hi){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid+1; } return lo; }
template<typename U>
double bsld(double lo, double hi, U f, double p = 1e-9){ int r = 3 + (int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? hi = mid : lo = mid; } return (lo + hi)/2; }
template<typename T, typename U>
T bsh(T lo, T hi, U f){ lo--; T mid; while(lo < hi){ mid = (lo + hi + 1)/2; f(mid) ? lo = mid : hi = mid-1; } return lo; }
template<typename U>
double bshd(double lo, double hi, U f, double p = 1e-9){ int r = 3+(int)log2((hi - lo)/p); double mid; while(r--){ mid = (lo + hi)/2; f(mid) ? lo = mid : hi = mid; } return (lo + hi)/2; }
// some more utility functions
template<typename T>
pair<T, int> get_min(vector<T> &v){ typename vector<T> :: iterator it = min_element(v.begin(), v.end()); return mp(*it, it - v.begin());}
template<typename T>
pair<T, int> get_max(vector<T> &v){ typename vector<T> :: iterator it = max_element(v.begin(), v.end()); return mp(*it, it - v.begin());}        
template<typename T> bool ckmin(T& a, const T& b){return b < a ? a = b , true : false;}
template<typename T> bool ckmax(T& a, const T& b){return b > a ? a = b, true : false;}

 
const int mod = (int)998244353;
struct Mint{
    int val;
    Mint(){ val = 0; }
    Mint(long long v){
        val = (-mod <= v && v < mod) ? v : v%mod;
        if(val < 0) val+= mod;
    }
    // operators
    Mint operator-(){return Mint(-val);}
    Mint& operator+=(const Mint& other){ val+=other.val; if(val >= mod) val-=mod; return *this;}
    Mint& operator-=(const Mint& other){ val-=other.val; if(val < 0) val+=mod; return *this;}
    Mint& operator*=(const Mint& other){ val=((long long)val*other.val)%mod; return *this;}
    friend Mint binpow(Mint a, long long p){
        Mint res(1);
        while(p > 0){
            if(p&1) res*=a; a*=a; p>>=1;
        }
        return res;
    }
    friend Mint inv(Mint a){ return binpow(a, mod-2); }
    Mint& operator/=(const Mint &other){ return (*this)*=inv(other);}
    
    friend Mint operator+(Mint a, const Mint& b){ return a+=b; }
    friend Mint operator-(Mint a, const Mint& b){ return a-=b; }
    friend Mint operator*(Mint a, const Mint& b){ return a*=b; }
    friend Mint operator/(Mint a, const Mint& b){ return a/=b; }
    
    bool operator==(const Mint &other){return val == other.val;}
    bool operator!=(const Mint &other){return val != other.val;}
    bool operator<(const Mint &other){return val < other.val;}
    // io
    friend ostream& operator<<(ostream &out, Mint &a){ return out << a.val; }
};
vector<Mint> pre(200005);
template<typename T>  
struct node{
    T val;
    T lazy;
    bool flag;
    node *l;
    node *r;
};
template<typename T, typename U> 
struct power_tree{
    deque<node<T>> _alloc;
    node<T> *root;
    U sz; T def, zero; 
    node<T>* get_new(){
        _alloc.push_back({zero, zero,false, nullptr, nullptr});
        return &_alloc.back();
    }
    power_tree(U _sz, T _zero, T _def){
        sz = _sz;
        zero = _zero;
        def = _def;
        root = get_new(); 
    }  
    T fcomb(T l, int lo1, int hi1, T r, int lo2, int hi2){
        Mint res = l + r;
        return res;
    }
    void push(node<T> *n, int lo1,int hi1, int lo2, int hi2){
        if(n->l == nullptr)
            n->l = get_new();
        if(n->r == nullptr)
            n->r = get_new();
        if(!n->flag) return;
        n->l->val = n->lazy * (pre[hi1] - pre[lo1]);
        n->r->val = n->lazy * (pre[hi2] - pre[lo2]);
        n->l->lazy = n->lazy;
        n->r->lazy = n->lazy;
        n->flag = false;
        n->l->flag = true;
        n->r->flag = true;
        n->lazy = 0;
    }
    T query(U l, U r){
         return query0(l, r, 0, sz, root);
    }
    T query0(U l, U r, U beg, U end, node<T> *n){
        if(beg >= r || end <= l)
            return def;
        if(beg >= l && end <= r)
            return n->val;
        //push(n);
        U mid = (beg + end)/2;
        return Mint(0);
        //return fcomb(query0(l, r, beg, mid, n->l), query0(l, r, mid, end, n->r));
    }
    void upd(U l, U r, T delta){ 
        upd0(l, r, 0, sz, delta, root);
    }
    void upd0(U l, U r, U beg, U end, T val, node<T> *n){  
        if(beg >= r || end <= l)
            return;
        if(beg >= l && end <= r){
            n->val = val * (pre[end] - pre[beg]);
            n->lazy = val; 
            n->flag = true;
            //cout << n->val << " " << n->lazy << " " << n->flag << endl; 
            return;
        }
        U mid = (beg + end)/2;
        push(n, beg, mid, mid, end);
        upd0(l, r, beg, mid, val, n->l);
        upd0(l, r, mid, end, val, n->r);
        //dbg(mp(beg, end));
        n->val = fcomb(n->l->val, beg, mid, n->r->val, mid, end);
        //cout << n->val << " " << n->lazy << " " << n->flag << endl;
        
    }
    /* void set(U pos, T val){ */
    /*     set0(pos, 0, sz, val, root); */
    /* } */
    /* void set0(U pos, U beg, U end, T val, node<T> *n){ */
    /*     if(beg+1 == end) { */
    /*         n->val = val; */
    /*         return; */
    /*     } */
    /*     push(n); */
    /*     U mid = (beg + end)/2; */
    /*     if(pos < mid) */
    /*         set0(pos, beg, mid, val, n->l); */
    /*     else */ 
    /*         set0(pos, mid, end, val, n->r); */
    /*     n->val = fcomb(n->l->val, n->r->val); */
    /* } */
};
int main(){
 	ios_base::sync_with_stdio(false);
 	cin.tie(NULL); cout.tie(NULL);
    int n, q; cin >> n >> q;
    Mint tres = Mint(1);
    pre[0] = tres;
    FOR(i, 1, n+4, 1){
        tres *= Mint(10);
        pre[i] = pre[i-1] + tres; 
    }
    pre.insert(pre.begin(), Mint(0));
    power_tree<Mint, int> pt(n, Mint(0), Mint(0));
    pt.upd(0, n, Mint(1));  
    REP(i, q){
        int a, b, d; cin >> a >> b >> d;
        a = n - a + 1;
        b = n - b + 1; 
        b--;
        pt.upd(b, a, Mint(d));
        Mint res = pt.query(0, n);
        cout << res << endl;
    }
    return 0;
}

Measured memory_bytes: 17052