#include <bits/stdc++.h>
using namespace std;
typedef long long ll;
#define ls (rt << 1)
#define rs (rt << 1 | 1)
const ll mod = 998244353;
const int maxn = 200000 + 10;
ll p[10][maxn], base[maxn];
int cov[maxn << 2];
int len[maxn << 2];
ll T[maxn << 2];
void pushup(int rt)
{
	T[rt] = (T[ls] * base[len[rs]] % mod + T[rs]) % mod;
}
void build(int rt, int l, int r)
{
	len[rt] = r - l + 1;
	T[rt] = p[1][len[rt]];
	if(l == r) return;
	int mid = l + r >> 1;
	build(ls, l, mid); build(rs, mid + 1, r);
}
void lazy(int rt, int d)
{
	cov[rt] = d;
	T[rt] = p[d][len[rt]];
}
void pushdown(int rt)
{
	if(cov[rt])
	{
		lazy(ls, cov[rt]);
		lazy(rs, cov[rt]);
		cov[rt] = 0;
	}
}
void update(int rt, int l, int r, int a, int b, int d)
{
	if(a <= l && r <= b)
	{
		lazy(rt, d);
		return;
	}
	int mid = l + r >> 1;
	pushdown(rt);
	if(a <= mid) update(ls, l, mid, a, b, d);
	if(b > mid) update(rs, mid + 1, r, a, b, d);
	pushup(rt);
}
int main()
{
	for(int i = 1; i <= 9; ++i) 
		for(int j = 1; j < maxn; ++j)
			p[i][j] = (p[i][j - 1] * 10 + i) % mod;
	base[0] = 1;
	for(int j = 1; j < maxn; ++j)
		base[j] = base[j - 1] * 10 % mod;
	int n, q;
	scanf("%d%d", &n, &q);
	build(1, 1, n);
	while(q--)
	{
		int l, r, d;
		scanf("%d%d%d", &l, &r, &d);
		update(1, 1, n, l, r, d);
		printf("%lld\n", T[1]);
	}
	return 0;
}
		
	 