#define _USE_MATH_DEFINES
#include <bits/stdc++.h>
using namespace std;
#define FOR(i,m,n) for(int i=(m);i<(n);++i)
#define REP(i,n) FOR(i,0,n)
#define ALL(v) (v).begin(),(v).end()
using ll = long long;
constexpr int INF = 0x3f3f3f3f;
constexpr ll LINF = 0x3f3f3f3f3f3f3f3fLL;
constexpr double EPS = 1e-8;
constexpr int MOD = 998244353;
constexpr int dy[] = {1, 0, -1, 0}, dx[] = {0, -1, 0, 1};
constexpr int dy8[] = {1, 1, 0, -1, -1, -1, 0, 1}, dx8[] = {0, -1, -1, -1, 0, 1, 1, 1};
template <typename T, typename U> inline bool chmax(T &a, U b) { return a < b ? (a = b, true) : false; }
template <typename T, typename U> inline bool chmin(T &a, U b) { return a > b ? (a = b, true) : false; }
struct IOSetup {
  IOSetup() {
    cin.tie(nullptr);
    ios_base::sync_with_stdio(false);
    cout << fixed << setprecision(20);
  }
} iosetup;

template <int MOD>
struct MInt {
  unsigned val;
  MInt(): val(0) {}
  MInt(long long x) : val(x >= 0 ? x % MOD : x % MOD + MOD) {}
  static int get_mod() { return MOD; }
  static void set_mod(int divisor) { assert(divisor == MOD); }
  MInt pow(long long exponent) const {
    MInt tmp = *this, res = 1;
    while (exponent > 0) {
      if (exponent & 1) res *= tmp;
      tmp *= tmp;
      exponent >>= 1;
    }
    return res;
  }
  MInt &operator+=(const MInt &x) { if((val += x.val) >= MOD) val -= MOD; return *this; }
  MInt &operator-=(const MInt &x) { if((val += MOD - x.val) >= MOD) val -= MOD; return *this; }
  MInt &operator*=(const MInt &x) { val = static_cast<unsigned long long>(val) * x.val % MOD; return *this; }
  MInt &operator/=(const MInt &x) {
    // assert(std::__gcd(static_cast<int>(x.val), MOD) == 1);
    unsigned a = x.val, b = MOD; int u = 1, v = 0;
    while (b) {
      unsigned tmp = a / b;
      std::swap(a -= tmp * b, b);
      std::swap(u -= tmp * v, v);
    }
    return *this *= u;
  }
  bool operator==(const MInt &x) const { return val == x.val; }
  bool operator!=(const MInt &x) const { return val != x.val; }
  bool operator<(const MInt &x) const { return val < x.val; }
  bool operator<=(const MInt &x) const { return val <= x.val; }
  bool operator>(const MInt &x) const { return val > x.val; }
  bool operator>=(const MInt &x) const { return val >= x.val; }
  MInt &operator++() { if (++val == MOD) val = 0; return *this; }
  MInt operator++(int) { MInt res = *this; ++*this; return res; }
  MInt &operator--() { val = (val == 0 ? MOD : val) - 1; return *this; }
  MInt operator--(int) { MInt res = *this; --*this; return res; }
  MInt operator+() const { return *this; }
  MInt operator-() const { return MInt(val ? MOD - val : 0); }
  MInt operator+(const MInt &x) const { return MInt(*this) += x; }
  MInt operator-(const MInt &x) const { return MInt(*this) -= x; }
  MInt operator*(const MInt &x) const { return MInt(*this) *= x; }
  MInt operator/(const MInt &x) const { return MInt(*this) /= x; }
  friend std::ostream &operator<<(std::ostream &os, const MInt &x) { return os << x.val; }
  friend std::istream &operator>>(std::istream &is, MInt &x) { long long val; is >> val; x = MInt(val); return is; }
};
namespace std { template <int MOD> MInt<MOD> abs(const MInt<MOD> &x) { return x; } }
template <int MOD>
struct Combinatorics {
  using ModInt = MInt<MOD>;
  int val;  // "val!" and "mod" must be disjoint.
  std::vector<ModInt> fact, fact_inv, inv;
  Combinatorics(int val = 10000000) : val(val), fact(val + 1), fact_inv(val + 1), inv(val + 1) {
    fact[0] = 1;
    for (int i = 1; i <= val; ++i) fact[i] = fact[i - 1] * i;
    fact_inv[val] = ModInt(1) / fact[val];
    for (int i = val; i > 0; --i) fact_inv[i - 1] = fact_inv[i] * i;
    for (int i = 1; i <= val; ++i) inv[i] = fact[i - 1] * fact_inv[i];
  }
  ModInt nCk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return 0;
    assert(n <= val && k <= val);
    return fact[n] * fact_inv[k] * fact_inv[n - k];
  }
  ModInt nPk(int n, int k) const {
    if (n < 0 || n < k || k < 0) return 0;
    assert(n <= val);
    return fact[n] * fact_inv[n - k];
  }
  ModInt nHk(int n, int k) const {
    if (n < 0 || k < 0) return 0;
    return k == 0 ? 1 : nCk(n + k - 1, k);
  }
};
using ModInt = MInt<MOD>;

struct SqrtDecomposition {
  int b, n;
  std::vector<int> left, right;
  std::vector<bool> need_to_be_eval;

  SqrtDecomposition(int n_) : b(std::sqrt(n_)) {
    n = (n_ + b - 1) / b;
    left.resize(n);
    right.resize(n);
    need_to_be_eval.assign(n, false);
    for (int i = 0; i < n; ++i) {
      left[i] = b * i;
      right[i] = i + 1 == n ? n_ : b * (i + 1);
    }
  }

  template <typename T> void partial_update(int idx, T val);

  template <typename T> void total_update(int idx, T val);

  template <typename T>
  void update(int l, int r, T val) {
    if (r <= l) return;
    int l_b = l / b, r_b = (r - 1) / b;
    if (l_b < r_b) {
      if (l == left[l_b]) {
        total_update(l_b, val);
      } else {
        for (int i = l; i < right[l_b]; ++i) partial_update(i, val);
      }
      for (int i = l_b + 1; i < r_b; ++i) total_update(i, val);
      if (r == right[r_b]) {
        total_update(r_b, val);
      } else {
        for (int i = left[r_b]; i < r; ++i) partial_update(i, val);
      }
    } else {
      for (int i = l; i < r; ++i) partial_update(i, val);
    }
  }

  template <typename T> void partial_query(int idx, T &val);

  template <typename T> void total_query(int idx, T &val);

  template <typename T>
  T query(int l, int r, const T UNITY) {
    int l_b = l / b, r_b = (r - 1) / b;
    T res = UNITY;
    if (l_b < r_b) {
      if (l == left[l_b]) {
        total_query(l_b, res);
      } else {
        for (int i = l; i < right[l_b]; ++i) partial_query(i, res);
      }
      for (int i = l_b + 1; i < r_b; ++i) total_query(i, res);
      if (r == right[r_b]) {
        total_query(r_b, res);
      } else {
        for (int i = left[r_b]; i < r; ++i) partial_query(i, res);
      }
    } else {
      for (int i = l; i < r; ++i) partial_query(i, res);
    }
    return res;
  }
};

vector<ModInt> wei, block, wei_sum;
vector<int> digit, last;

template <typename T>
void SqrtDecomposition::partial_update(int idx, T val) {
  int pos = idx / b;
  if (need_to_be_eval[pos]) {
    FOR(i, left[pos], right[pos]) digit[i] = last[pos];
    need_to_be_eval[pos] = false;
  }
  block[pos] -= wei[idx] * digit[idx];
  digit[idx] = val;
  block[pos] += wei[idx] * digit[idx];
}

template <typename T>
void SqrtDecomposition::total_update(int idx, T val) {
  block[idx] = wei_sum[idx] * val;
  last[idx] = val;
  need_to_be_eval[idx] = true;
}

template <typename T>
void SqrtDecomposition::partial_query(int idx, T &val) {
  int pos = idx / b;
  if (need_to_be_eval[pos]) {
    FOR(i, left[pos], right[pos]) digit[i] = last[pos];
    need_to_be_eval[pos] = false;
  }
  val += wei[idx] * digit[idx];
}

template <typename T>
void SqrtDecomposition::total_query(int idx, T &val) {
  val += block[idx];
}

int main() {
  int n, q; cin >> n >> q;
  wei.resize(n);
  wei[n - 1] = 1;
  for (int i = n - 2; i >= 0; --i) wei[i] = wei[i + 1] * 10;
  digit.assign(n, 1);
  SqrtDecomposition sd(n);
  block.assign(sd.n, 0);
  wei_sum.assign(sd.n, 0);
  REP(i, n) {
    block[i / sd.b] += wei[i];
    wei_sum[i / sd.b] += wei[i];
  }
  last.resize(sd.n, 0);
  while (q--) {
    int l, r, d; cin >> l >> r >> d; --l; --r;
    sd.update(l, r + 1, d);
    cout << sd.query(0, n, ModInt(0)) << '\n';
  }
  return 0;
}


Measured memory_bytes: 4788