#pragma GCC optimize("Ofast")
#pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma GCC optimize("unroll-loops")
//#pragma warning(disable : 4996)

#define ATCODER
#ifdef ATCODER
#include<atcoder/all>
using namespace atcoder;
#endif

#include <algorithm>
#include <utility>
#include <vector>

#ifdef _MSC_VER
#include <intrin.h>
#define __builtin_popcount __popcnt
#define __builtin_popcountll __popcnt64

#endif

#include <limits.h>
#include <math.h>
#include <time.h>

#include <algorithm>
#include <array>
#include <bitset>
#include <cassert>
#include <complex>
#include <cstdio>
#include <cstring>
#include <functional>
#include <iomanip>
#include <iostream>
#include <iterator>
#include <map>
#include <numeric>
#include <queue>
#include <random>
#include <set>
#include <stack>
#include <string>
#include <unordered_map>
#include <unordered_set>
#include <vector>

using namespace std;

#define REP(i, n) for (int i = 0; i < (n); ++i)
#define REPR(i, n) for (int i = n - 1; i >= 0; --i)
#define FOR(i, m, n) for (int i = m; i < n; ++i)
#define FORR(i, m, n) for (int i = n - 1; i >= m; --i)
#define SORT(v, n) sort(v, v + n);
#define VSORT(v) sort(v.begin(), v.end());
#define REVERSE(v, n) reverse(v, v + n);
#define VREVERSE(v) reverse(v.begin(), v.end())
#define ll long long
#define print(x) cout << (x) << '\n'
#define pe(x) cout << (x) << " "
#define DEBUG(x) cerr << #x << ": " << x << endl
#define spa << " " <<
#define lb(v, n) lower_bound(v.begin(), v.end(), (n))
#define ub(v, n) upper_bound(v.begin(), v.end(), (n))
#define int long long
//#define double long double
#define all(x) (x).begin(), (x).end()
#define print_space(v) REP(i, v.size()) cout << v[i] << " \n"[i==(int)v.size()-1]
template <typename T1, typename T2> inline void chmin(T1 & a, T2 b) { if (a > b) a = b; }
template <typename T1, typename T2> inline void chmax(T1& a, T2 b) { if (a < b) a = b; }
typedef pair<int, int> pii;
typedef pair<long long, long long> pll;
std::random_device rd;
std::mt19937 mt(rd());
constexpr ll MOD = 998244353;
constexpr int MAX = 500050;
constexpr ll LINF = 1e17 + 1;
constexpr int INF = 1e9 + 1;

using mint = modint998244353;
mint p10[200020];
mint cum[11][200020];
using F = int;
const F ID = 10;
struct S {
	mint val;
	int d, sz;
};

S op(S a, S b) {
	if (a.d > b.d)swap(a, b);
	return { a.val + b.val*p10[b.d-a.d],a.d,a.sz + b.sz };
	//else return{ b.val + a.val*p10[a.d],b.d,a.sz + b.sz };
}
S e() {
	return { (mint)0,200001,0 };
}
S mapping(F f, S x) {
	if (f == ID)return x;
	return { cum[f][x.sz],x.d,x.sz };
}
F composition(F f, F g) {
	return (f == ID ? g : f);
}
F id() {
	return ID;
}

void solve() {
	p10[0] = 1;
	REP(i, 200001)p10[i + 1] = p10[i] * 10;
	FOR(i, 1, 10) {
		cum[i][1] = i;
		FOR(j, 1, 200001)cum[i][j + 1] = cum[i][j] + p10[j] * i;
	}
	int N, Q; cin >> N >> Q;
	vector<S>v(N);
	REP(i, N) {
		v[i] = { (mint)1,i,1 };
	}
	lazy_segtree<S, op, e, F, mapping, composition, id>seg(v);
	REP(i, N) {
		//seg.set(i,{ 1,i,1 });
		//S tmp = seg.get(i);
		//DEBUG(tmp.val.val());
		//DEBUG(tmp.d);
		//DEBUG(tmp.sz);
	}
	S s = seg.prod(0, N-4);

	//print((s.val*p10[s.d]).val());
	//print(seg.all_prod().val*p10.val());
	//print(s.d);
	//print(s.sz);
	REP(_, Q) {
		int l, r; cin >> l >> r;
		int c; cin >> c;
		r = N - r, l = N - l + 1;

		swap(l, r);
		//DEBUG(l); DEBUG(r);
		seg.apply(l, r, c);
		//print("a");
		print(seg.all_prod().val.val());
	}
}



signed main() {
	cin.tie(0);
	ios::sync_with_stdio(false);
	//int q;
	//cin >> q;
	//while (q--)
	solve();

}


Measured memory_bytes: 31752