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

typedef long long ll;
typedef vector<int> VI;
typedef vector<VI> VVI;
typedef vector<long long> VL;
typedef vector<vector<long long>> VVL;
typedef pair<int,int> P;
typedef tuple<int,int,int> tpl;

#define ALL(a)  (a).begin(),(a).end()
#define SORT(c) sort((c).begin(),(c).end())
#define REVERSE(c) reverse((c).begin(),(c).end())
#define EXIST(m,v) (m).find((v)) != (m).end()
#define LB(a,x) lower_bound((a).begin(), (a).end(), x) - (a).begin()
#define UB(a,x) upper_bound((a).begin(), (a).end(), x) - (a).begin()

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

#define en "\n"

constexpr double EPS = 1e-9;
constexpr double PI  = 3.1415926535897932;
constexpr int INF = 2147483647;
constexpr long long LINF = 1LL<<60;
constexpr long long MOD = 998244353;

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

template <typename T,typename E>
struct LazySegmentTree{
    typedef function<T(T,T)> F;
    typedef function<T(T,E)> G;
    typedef function<E(E,E)> H;
    typedef function<E(E,int)> P;
    int n;
    G g;
    H h;
    T d1;
    E d0;
    vector<T> val;
    vector<E> lazy;
    VL len_;
    VL po;
    VVL aaa;

    LazySegmentTree(vector<T> a, G g_, H h_, T d1_, E d0_):
        g(g_),h(h_),d1(d1_),d0(d0_){

        int sz = a.size();
        n = 1;
        while (n < sz) n <<= 1;
        val.clear();
        val.resize(2 * n - 1, d1);
        lazy.clear();
        lazy.resize(2 * n - 1, d0);
        len_.clear();
        len_.resize(2*n-1); len_[0] = n;
        po.clear();
        po.resize(2*n-1,1);
        REP(i,2*n-2) po[i+1] = po[i]*10 % MOD;
        REP(i,2*n-2){
            len_[i+1] = len_[i/2]>>1;
        }
        for (int i = 0; i < sz; i++) val[i + n - 1] = a[i];
        for (int i = n - 2; i >= 0; i--) val[i] = f(val[i * 2 + 1], val[i * 2 + 2], len_[i*2+2]);

        aaa.resize(10,VL(2*n,0));
        REP(i,10){
            REP(j,2*n-1) aaa[i][j+1] = (aaa[i][j]*10 + i) % MOD;
        }
    }

    ll f(ll a, ll b, int len){
        return (a*po[len] + b) % MOD;
    }

    ll p(ll a, int len){
        return aaa[a][len];
    }

    inline void eval(int k, int len){
        if(lazy[k] == d0) return;

        if(2*k+1 < 2*n-1){
            lazy[2*k+1] = h(lazy[2*k+1], lazy[k]);
            lazy[2*k+2] = h(lazy[2*k+2], lazy[k]);
        }
        val[k] = g(val[k], p(lazy[k], len));
        lazy[k] = d0;
    }

    void update(int a, int b, E x, int k=0, int l=0, int r=-1){
        // 0-indexed
        // [a,b)に対して操作
        if(r < 0) r = n;
        eval(k, r-l);
        if(r <=a || b <= l) return;

        if(a <= l && r <= b){
            lazy[k] = h(lazy[k], x);
            eval(k, r-l);
        }
        else{
            update(a, b, x, 2*k+1, l, (l+r)/2);
            update(a, b, x, 2*k+2, (l+r)/2, r);
            val[k] = f(val[2*k+1], val[2*k+2], len_[2*k+2]);
        }
    }

    int length(int a, int b, int l, int r){
        if(a<=l && r<=b) return r-l;
        else if(l<b) return b-l;
        else return 0;
    }

    T query(int a, int b, int k=0, int l=0, int r=-1){
        // 0-indexed
        // [a,b)に対してquery
        if(r < 0) r = n;
        eval(k, r-l);
        if(r <= a || b <= l) return d1;
        if(a <= l && r <= b) return val[k];
        T val_l = query(a, b , 2*k+1, l, (l+r)/2);
        T val_r = query(a, b , 2*k+2, (l+r)/2, r);
        int len = length(a,b,(l+r)/2, r);
        return f(val_l, val_r, len);
    }

    int findL(int a, int b, const function<bool(T)>& check, int k=0, int l=0, int r=-1){
        // 0-indexed
        // [a,b)でf(val[k])がtrueとなるような最小のkを返す 無ければ-1を返す
        // a      k         b
        // xxxxxxxoooooooooo

        if(r<0) r = n;
        eval(k, r-l);
        if(!check(val[k]) || (r<=a || b<=l)) return -1;
        if(r-l == 1) return l;

        int lv = findL(a, b, check, 2*k+1, l, (l+r)/2);
        if(lv != -1) return lv;

        int rv = findL(a, b, check, 2*k+2, (l+r)/2, r);
        return rv;
    }

    int findR(int a, int b, const function<bool(T)>& check, int k=0, int l=0, int r=-1){
        // 0-indexed
        // [a,b)でf(val[k])がtrueとなるような最大のkを返す 無ければ-1を返す
        // a      k         b
        // ooooooooxxxxxxxxx

        if(r<0) r = n;
        eval(k, r-l);
        if(!check(val[k]) || (r<=a || b<=l)) return -1;
        if(r-l == 1) return l;

        int rv = findR(a, b, check, 2*k+2, (l+r)/2, r);
        if(rv != -1) return rv;

        int lv = findR(a, b, check, 2*k+1, l, (l+r)/2);
        return lv;
    }
};

ll g(ll a, ll b){return b;}
ll h(ll a, ll b){return b;}

void Main(){
    int N,Q; cin >> N >> Q;
    LazySegmentTree<ll,ll> st(VL(N,1),g,h,0,0);

    REP(_,Q){
        int l,r,d; cin >> l >> r >> d; l--;
        st.update(l,r,d);
        ll ans = st.query(0,N);
        cout << ans << en;
    }

    return;
}

int main(void){
    cin.tie(0);cout.tie(0);ios_base::sync_with_stdio(0);cout<<fixed<<setprecision(15);
    int t=1; //cin>>t;
    REP(_,t) Main();
    return 0;
}

Measured memory_bytes: 66272