#define LOCAL
#define _USE_MATH_DEFINES
#include <array>
#include <cassert>
#include <cstdio>
#include <cstring>
#include <iostream>
#include <iomanip>
#include <string>
#include <sstream>
#include <vector>
#include <queue>
#include <stack>
#include <list>
#include <set>
#include <map>
#include <unordered_set>
#include <unordered_map>
#include <algorithm>
#include <complex>
#include <cmath>
#include <numeric>
#include <bitset>
#include <functional>
#include <random>
#include <ctime>

using namespace std;

template <typename A, typename B>
ostream& operator <<(ostream& out, const pair<A, B>& a) {
  out << "(" << a.first << "," << a.second << ")";
  return out;
}
template <typename T, size_t N>
ostream& operator <<(ostream& out, const array<T, N>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T>
ostream& operator <<(ostream& out, const vector<T>& a) {
  out << "["; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "]";
  return out;
}
template <typename T, class Cmp>
ostream& operator <<(ostream& out, const set<T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& v : a) { out << (first ? "" : ", "); out << v; first = 0;} out << "}";
  return out;
}
template <typename U, typename T, class Cmp>
ostream& operator <<(ostream& out, const map<U, T, Cmp>& a) {
  out << "{"; bool first = true;
  for (auto& p : a) { out << (first ? "" : ", "); out << p.first << ":" << p.second; first = 0;} out << "}";
  return out;
}
#ifdef LOCAL
#define trace(...) __f(#__VA_ARGS__, __VA_ARGS__)
#else
#define trace(...) 42
#endif
template <typename Arg1>
void __f(const char* name, Arg1&& arg1){
  cerr << name << ": " << arg1 << endl;
}
template <typename Arg1, typename... Args>
void __f(const char* names, Arg1&& arg1, Args&&... args){
  const char* comma = strchr(names + 1, ',');
  cerr.write(names, comma - names) << ": " << arg1 << " |";
  __f(comma + 1, args...);
}

typedef long long int64;
typedef pair<int, int> ii;
#define SZ(x) (int)((x).size())
const int INF = 1 << 29;
const int MOD = 998244353;
mt19937 mrand(random_device{}());
int rnd(int x) { return mrand() % x; }

struct fast_ios {
  fast_ios() {
    cin.tie(nullptr);
    ios::sync_with_stdio(false);
    cout << fixed << setprecision(10);
  };
} fast_ios_;

const int N = 2e5 + 10;
int pre[N];

void add(int& x, int y) {
  x += y;
  if (x >= MOD) x -= MOD;
}

struct Node {
  Node *left, *right;
  int sum, delta;
  void update(int a, int b, int c) {
    sum = 1LL * (pre[b] + MOD - pre[a]) * c % MOD;
    delta = c;
  }
  void pushup() {
    sum = left->sum + right->sum;
    if (sum >= MOD) sum -= MOD;
  }
  void pushdown(int a, int b) {
    if (delta) {
      int mid = (a + b) / 2;
      left->update(a, mid, delta);
      right->update(mid, b, delta);
      delta = 0;
    }
  }
};

Node pool[N << 1], *last;

Node* build(int a, int b) {
  Node* ret = last++;
  ret->delta = 0;
  if (a + 1 == b) {
    ret->sum = (pre[b] + MOD - pre[a]) % MOD;
    return ret;
  }
  int mid = (a + b) / 2;
  ret->left = build(a, mid);
  ret->right = build(mid, b);
  ret->pushup();
  return ret;
}

void insert(Node* cur, int a, int b, int ll, int rr, int c) {
  if (ll >= rr || a >= rr || b <= ll) return;
  if (a >= ll && b <= rr) {
    cur->update(a, b, c);
    return;
  }
  cur->pushdown(a, b);
  int mid = (a + b) / 2;
  insert(cur->left, a, mid, ll, rr, c);
  insert(cur->right, mid, b, ll, rr, c);
  cur->pushup();
}

int main() {
  vector<int> ten(N);
  ten[0] = 1;
  for (int i = 1; i < N; ++i) ten[i] = ten[i - 1] * 10LL % MOD;
  for (int i = 0; i < N - 1; ++i) pre[i + 1] = (pre[i] + ten[i]) % MOD;

  int n, q;
  cin >> n >> q;
  last = pool;
  Node* root = build(0, n);
  while (q--) {
    int L, R, c;
    cin >> L >> R >> c;
    int ll = n - R, rr = n - L + 1;
    insert(root, 0, n, ll, rr, c);
    cout << root->sum << '\n';
  }
  return 0;
}


Measured memory_bytes: 13708