#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 = m - 1; i >= n; --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) cout << #x << ": " << x << endl
#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 = 4400000;
const double pi = acos(-1);
constexpr double EPS = 1e-8;
constexpr ll LINF = 1e17 + 1;
constexpr int INF = 1e9 + 1;


//const int mod = 1000000007;
const int mod = 998244353;
struct mint {
	ll x; // typedef long long ll;
	mint(ll x = 0) :x((x% mod + mod) % mod) {}
	mint operator-() const { return mint(-x); }
	mint& operator+=(const mint a) {
		if ((x += a.x) >= mod) x -= mod;
		return *this;
	}
	mint & operator-=(const mint a) {
		if ((x += mod - a.x) >= mod) x -= mod;
		return *this;
	}
	mint & operator*=(const mint a) { (x *= a.x) %= mod; return *this; }
	mint operator+(const mint a) const { return mint(*this) += a; }
	mint operator-(const mint a) const { return mint(*this) -= a; }
	mint operator*(const mint a) const { return mint(*this) *= a; }
	mint pow(ll t) const {
		if (!t) return 1;
		mint a = pow(t >> 1);
		a *= a;
		if (t & 1) a *= *this;
		return a;
	}

	// for prime mod
	mint inv() const { return pow(mod - 2); }
	mint& operator/=(const mint a) { return *this *= a.inv(); }
	mint operator/(const mint a) const { return mint(*this) /= a; }
};
istream& operator>>(istream & is, const mint & a) { return is >> a.x; }
ostream& operator<<(ostream & os, const mint & a) { return os << a.x; }

const int B = 450;
mint A[500];
int val[300020];
int N;
int isall[500];
mint cum[10];
void init() {
	FOR(i, 1, 10) {
		mint p10 = 1;
		REP(_, B) {
			cum[i] += p10 * i;
			p10 *= 10;
		}
	}
}
void eval(int id) {
	if (!isall[id])return;
	FOR(i, id * B, min(N, id * B + B))val[i] = isall[id];
	isall[id] = 0;
}

mint t = 10;
mint pt = t.pow(B);
mint getans() {
	mint p10 = 1;
	mint ans = 0;
	for (int id = 0; id * B <= N; id++) {
		ans += A[id] * p10;
		p10 *= pt;
	}
	return ans;
}
mint calc(int id) {
	mint res = 0;
	mint p10 = 1;
	//DEBUG(id);
	FOR(i, id * B, min(N, id * B + B)) {
		res += p10 * val[i];
		p10 *= 10;
	}
	//print("ok");
	return A[id] = res;
}
void update(int l, int r, int c) {
	int m1 = l + B - (l % B);
	int m2 = r - r % B;
	//DEBUG(m1);
	//DEBUG(m2);
	if (m1 > m2) {
		if (isall[m2 / B])eval(m2 / B);

		FOR(i, l, r)val[i] = c;
		A[m2 / B] = calc(m2 / B);
		//print("a");
	}
	else {
		int id1 = (l) / B, id2 = r / B;
		//DEBUG(id1);
		//DEBUG(id2);
		eval(id1);
		eval(id2);
		FOR(i, l, m1)val[i] = c;
		FOR(i, m2, r)val[i] = c;
		FOR(id, id1 + 1, id2) {
			isall[id] = c;
			A[id] = cum[c];
		}
		calc(l / B);
		calc(r / B);
	}
}
void solve() {
	init();
	cin >> N;
	int Q; cin >> Q;
	REP(i, N) {
		val[i] = 1;
	}
	for (int id = 0; id * B <= N; id++)calc(id);

	REP(_, Q) {
		int l, r, c; cin >> l >> r >> c;
		r = N - r;
		l = N - l;
		l++;
		swap(l, r);
		//DEBUG(l);
		//DEBUG(r);
		update(l, r, c);
		print(getans());
	}
}



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

}


Measured memory_bytes: 5252