//c++ -std=gnu++14 a.cpp
#include <algorithm>
#include <bitset>
#include <complex>
#include <deque>
#include <iostream>
#include <istream>
#include <iterator>
#include <map>
#include <queue>
#include <set>
#include <stack>
#include <string>
#include <vector>
#include <tuple>
#include <iomanip>
#include <climits>
#include <fstream>
#include <random>
using namespace std;

typedef long long ll;
typedef unsigned long long ull;
//typedef pair<ll, ll> P;
#define rep(i, n) for(int i = 0; i < (n); i++)
#define revrep(i, n) for(int i = (n)-1; i >= 0; i--)
#define pb push_back
#define f first
#define s second
#define chmin(x, y) x = min(x, y);
#define chmax(x, y) x = max(x, y);
#define len(x) ((int)(x).size())

//const ll INFL = LLONG_MAX;//10^18 = 2^60
const ll INFL = 1LL<<60;
//const int INF = INT_MAX;
const int INF = 1 << 30;//10^9
//const ll MOD = 1000000007;
const ll MOD = 998244353;
double EPS = 1e-10;

vector<ll> dy = {0, 1, 0, -1, 1, 1, -1, -1, 0};
vector<ll> dx = {1, 0, -1, 0, 1, -1, 1, -1, 0};

void pres(double A){printf("%.9lf\n", A);}
void BinarySay(ll x, ll y = 60){rep(i, y) cout << (x>>(y-1-i) & 1); cout << endl;}
ll cnt_bit(ll x){return __builtin_popcountll(x);}

ll pow_long(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2) res *= x;
    x *= x; k /= 2;
  }
  return res;
}

ll pow_mod(ll x, ll k){
  ll res = 1;
  while(k > 0){
    if(k % 2){
      res *= x; res %= MOD;
    }
    x *= x; x %= MOD;
    k /= 2;
  }
  return res;
}

ll inverse(ll x){return pow_mod(x, MOD - 2);};

ll gcd(ll a, ll b){
    if(b == 0) return a;
    return gcd(b, a % b);
}

ll lcm(ll x, ll y){
  ll res = x / gcd(x, y);
  res *= y;
  return res;
};

/*
//コンビネーション
const int MAXcomb = 2000010;
ll fac[MAXcomb], finv[MAXcomb], inv[MAXcomb];
//facはn!,finvは1/n!
//invは逆元
void COMinit(){
    fac[0] = fac[1] = 1;
    finv[0] = finv[1] = 1;
    inv[1] = 1;
    for(int i = 2; i < MAXcomb; i++){
        fac[i] = fac[i-1] * i % MOD;
        inv[i] = MOD - inv[MOD%i] * (MOD/i) % MOD;
        finv[i] = finv[i-1] * inv[i] % MOD;
    }
}
ll comb(int n, int k){
    if(n < k) return 0;
    if(n < 0 || k < 0) return 0;
    return fac[n] * finv[k] % MOD * finv[n-k] % MOD;
}
*/


ll disit(ll s, ll base = 10){
  ll res = 0;
  while(s){
    res++;
    s /= base;
  }
  return res;
}


const ll N_ = (1<<18);
struct SegTree{
  //区間変更区間和
  //初期値-1にしている
  vector<ll> seg, lazy, one, po;
  void init_seg(){
    seg.resize(2 * N_ - 1, 0);
    lazy.resize(2 * N_ - 1, -1);
    one.resize(2 * N_ - 1);
    po.resize(2 * N_ - 1);
    one[0] = 0;
    po[0] = 1;
    ll x = 1;
    rep(i, 2 * N_ - 1){
      if(i == 0) continue;
      one[i] = one[i-1] + x;
      one[i] %= MOD;
      x *= 10;
      x %= MOD;
      po[i] = po[i-1] * 10 % MOD;
    }
  }

  void eval(ll k, ll l, ll r){
    if(lazy[k] == -1) return;
    ll n = (r - l);
    seg[k] = lazy[k] * one[r - l] % MOD;
    if(r - l > 1){
      lazy[2 * k + 1] = lazy[k];
      lazy[2 * k + 2] = lazy[k];
    }
    lazy[k] = -1;
  }

  void update(ll a, ll b, ll x, ll k = 0, ll l = 0, ll r = N_){
    eval(k, l, r);
    if(r <= a || b <= l) return;
    if(a <= l && r <= b){
      lazy[k] = x;
      eval(k, l, r);
      return;
    }

    update(a, b, x, 2 * k + 1, l, (l + r) / 2);
    update(a, b, x, 2 * k + 2, (l + r) / 2, r);
    eval(k, l, r);
    ll n = (r - l) / 2;
    seg[k] = (seg[2 * k + 1] + seg[2 * k + 2] * po[n] % MOD) % MOD;
    return;
  }

  ll getsum(ll a, ll b, ll k = 0, ll l = 0, ll r = N_, ll h = 0){
    if(r <= a || b <= l) return 0;
    eval(k, l, r);
    if(a <= l && r <= b) return seg[k];
    ll left = getsum(a, b, 2 * k + 1, l, (l + r) / 2, h);
    ll right = getsum(a, b, 2 * k + 2, (l + r) / 2, r, h);
    ll n = (r - l) / 2;
    right = right * po[n] % MOD;
    return (left + right) % MOD;
  }
};

int N, Q;
int L[200010], R[200010], D[200010];

void solve(){
  SegTree segTree;
  segTree.init_seg();
  cin >> N >> Q;
  rep(i, Q) cin >> R[i] >> L[i] >> D[i];
  rep(i, Q){
    L[i] = N - L[i];
    R[i] = N - R[i] + 1;
  }
  segTree.update(0, N, 1);
  rep(i, Q){
    segTree.update(L[i], R[i], D[i]);
    cout << segTree.getsum(0, N) << endl;
  }
}

int main(){
  cin.tie(0);
  ios::sync_with_stdio(false);
  solve();
}


Measured memory_bytes: 21908