#include <bits/stdc++.h>
using namespace std;
/*
#include <atcoder/all>
using namespace atcoder;
*/
/*
#include <boost/multiprecision/cpp_int.hpp>
#include <boost/multiprecision/cpp_dec_float.hpp>
using bll = boost::multiprecision::cpp_int;
using bdouble = boost::multiprecision::number<boost::multiprecision::cpp_dec_float<100>>;
using namespace boost::multiprecision;
*/
#ifdef LOCAL_TEST
	#define BOOST_STACKTRACE_USE_ADDR2LINE
	#define BOOST_STACKTRACE_ADDR2LINE_LOCATION /usr/local/opt/binutils/bin/addr2line
	#define _GNU_SOURCE 1
	#include <boost/stacktrace.hpp>
	namespace std {
		template<typename T> class dvector : public std::vector<T> {
		public:
			dvector() : std::vector<T>() {}
			explicit dvector(size_t n, const T& value = T()) : std::vector<T>(n, value) {}
			dvector(const std::vector<T>& v) : std::vector<T>(v) {}
			dvector(const std::initializer_list<T> il) : std::vector<T>(il) {}
			dvector(const std::string::iterator first, const std::string::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::iterator first, const typename std::vector<T>::iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::reverse_iterator first, const typename std::vector<T>::reverse_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_iterator first, const typename std::vector<T>::const_iterator last) : std::vector<T>(first, last) {}
			dvector(const typename std::vector<T>::const_reverse_iterator first, const typename std::vector<T>::const_reverse_iterator last) : std::vector<T>(first, last) {}
			T& operator[](size_t n) {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
			const T& operator[](size_t n) const {
				try { return this->at(n); } catch (const std::exception& e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; return this->at(n); }
			}
		};
	}
	class dbool {
	private:
		bool boolvalue;
	public:
		dbool() : boolvalue(false) {}
		dbool(bool b) : boolvalue(b) {}
		operator bool&() { return boolvalue; }
		operator const bool&() const { return boolvalue; }
	};
	#define vector dvector
	#define bool dbool
	class SIGFPE_exception : std::exception {};
	class SIGSEGV_exception : std::exception {};
	void catch_SIGFPE([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGFPE_exception(); }
	void catch_SIGSEGV([[maybe_unused]] int e) { std::cerr << boost::stacktrace::stacktrace() << '\n'; throw SIGSEGV_exception(); }
	signed convertedmain();
	signed main() { signal(SIGFPE, catch_SIGFPE); signal(SIGSEGV, catch_SIGSEGV); return convertedmain(); }
	#define main() convertedmain()
#endif
#ifdef LOCAL_DEV
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::pair<T1, T2>& p) {
		return s << "(" << p.first << ", " << p.second << ")"; }
	template <typename T, size_t N> std::ostream& operator<<(std::ostream& s, const std::array<T, N>& a) {
		s << "{ "; for (size_t i = 0; i < N; ++i){ s << a[i] << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::set<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::multiset<T>& se) {
		s << "{ "; for (auto itr = se.begin(); itr != se.end(); ++itr){ s << (*itr) << "\t"; } s << "}"; return s; }
	template<typename T1, typename T2> std::ostream& operator<<(std::ostream& s, const std::map<T1, T2>& m) {
		s << "{\n"; for (auto itr = m.begin(); itr != m.end(); ++itr){ s << "\t" << (*itr).first << " : " << (*itr).second << "\n"; } s << "}"; return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::deque<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<T>& v) {
		for (size_t i = 0; i < v.size(); ++i){ s << v[i]; if (i < v.size() - 1) s << "\t"; } return s; }
	template<typename T> std::ostream& operator<<(std::ostream& s, const std::vector<std::vector<T>>& vv) {
		s << "\\\n"; for (size_t i = 0; i < vv.size(); ++i){ s << vv[i] << "\n"; } return s; }
	void debug_impl() { std::cerr << '\n'; }
	template<typename Head, typename... Tail> void debug_impl(Head head, Tail... tail) { std::cerr << " " << head << (sizeof...(tail) ? "," : ""); debug_impl(tail...); }
	#define debug(...) do { std::cerr << ":" << __LINE__ << " (" << #__VA_ARGS__ << ") ="; debug_impl(__VA_ARGS__); } while (false)
#else
	#define debug(...) do {} while (false)
#endif
//#define int long long
using ll = long long;
//constexpr int INF = (ll)1e9 + 7; //INT_MAX = (1<<31)-1 = 2147483647
constexpr ll INF = (ll)1e18; //(1LL<<63)-1 = 9223372036854775807
//constexpr ll MOD = (ll)1e9 + 7; //primitive root = 5
constexpr ll MOD = 998244353; //primitive root = 3
constexpr double EPS = 1e-9;
constexpr ll dx[4] = {1, 0, -1, 0};
constexpr ll dy[4] = {0, 1, 0, -1};
constexpr ll dx8[8] = {1, 0, -1, 0, 1, 1, -1, -1};
constexpr ll dy8[8] = {0, 1, 0, -1, 1, -1, 1, -1};
#define rep(i, n)   for(ll i=0, i##_length=(n); i< i##_length; ++i)
#define repeq(i, n) for(ll i=1, i##_length=(n); i<=i##_length; ++i)
#define rrep(i, n)   for(ll i=(n)-1; i>=0; --i)
#define rrepeq(i, n) for(ll i=(n)  ; i>=1; --i)
#define all(v) (v).begin(), (v).end()
#define rall(v) (v).rbegin(), (v).rend()
void p() { std::cout << '\n'; }
template<typename Head, typename... Tail> void p(Head head, Tail... tail) { std::cout << head << (sizeof...(tail) ? " " : ""); p(tail...); }
template<typename T> inline void pv(std::vector<T>& v) { for(ll i=0, N=v.size(); i<N; i++) std::cout << v[i] << " \n"[i==N-1]; }
template<typename T> inline bool chmax(T& a, T b) { return a < b && (a = b, true); }
template<typename T> inline bool chmin(T& a, T b) { return a > b && (a = b, true); }
template<typename T> inline void uniq(std::vector<T>& v) { v.erase(std::unique(v.begin(), v.end()), v.end()); }

/*-----8<-----template-----8<-----*/


inline constexpr ll extgcd(ll a, ll b, ll &x, ll &y){ ll g = a; x = 1; y = 0; if(b){ g = extgcd(b, a % b, y, x); y -= a / b * x; } return g; }
inline constexpr ll invmod(ll a, ll m = MOD){ ll x = 0, y = 0; extgcd(a, m, x, y); return (x + m) % m; }
class Modint{
public:
	ll _num;
	constexpr Modint() : _num() { _num = 0; }
	constexpr Modint(ll x) : _num() { _num = x % MOD; if(_num < 0) _num += MOD; }
	inline constexpr Modint operator= (int x){ _num = x % MOD; if(_num<0) _num += MOD; return *this; }
	inline constexpr Modint operator= (ll x){ _num = x % MOD; if(_num<0) _num += MOD; return *this; }
	//inline constexpr Modint operator= (Modint x){ _num = x._num; return *this; }
	inline constexpr Modint operator+ (int x){ return Modint(_num + x); }
	inline constexpr Modint operator+ (ll x){ return Modint(_num + x); }
	inline constexpr Modint operator+ (Modint x){ ll a = _num + x._num; if(a >= MOD) a -= MOD; return Modint{a}; }
	inline constexpr Modint operator+=(int x){ _num += x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator+=(ll x){ _num += x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator+=(Modint x){ _num += x._num; if(_num >= MOD) _num -= MOD; return *this; }
	inline constexpr Modint operator++(){ _num++; if(_num == MOD) _num = 0; return *this; }
	inline constexpr Modint operator- (int x){ return Modint(_num - x); }
	inline constexpr Modint operator- (ll x){ return Modint(_num - x); }
	inline constexpr Modint operator- (Modint x){ ll a = _num - x._num; if(a < 0) a += MOD; return Modint{a}; }
	inline constexpr Modint operator-=(int x){ _num -= x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator-=(ll x){ _num -= x; _num %= MOD; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator-=(Modint x){ _num -= x._num; if(_num < 0) _num += MOD; return *this; }
	inline constexpr Modint operator--(){ _num--; if(_num == -1) _num = MOD - 1; return *this; }
	inline constexpr Modint operator* (int x){ return Modint(_num * (x % MOD)); }
	inline constexpr Modint operator* (ll x){ return Modint(_num * (x % MOD)); }
	inline constexpr Modint operator* (Modint x){ return Modint{_num * x._num % MOD}; }
	inline constexpr Modint operator*=(int x){ _num *= Modint(x); _num %= MOD; return *this; }
	inline constexpr Modint operator*=(ll x){ _num *= Modint(x); _num %= MOD; return *this; }
	inline constexpr Modint operator*=(Modint x){ _num *= x._num; _num %= MOD; return *this; }
	inline constexpr Modint operator/ (int x){ return Modint(_num * invmod(Modint(x), MOD)); }
	inline constexpr Modint operator/ (ll x){ return Modint(_num * invmod(Modint(x), MOD)); }
	inline constexpr Modint operator/ (Modint x){ return Modint{_num * invmod(x._num, MOD) % MOD}; }
	inline constexpr Modint operator/=(int x){ _num *= invmod(Modint(x), MOD); _num %= MOD; return *this; }
	inline constexpr Modint operator/=(ll x){ _num *= invmod(Modint(x), MOD); _num %= MOD; return *this; }
	inline constexpr Modint operator/=(Modint x){ _num *= invmod(x._num, MOD); _num %= MOD; return *this; }
	inline constexpr Modint pow(ll n){ ll i = 1, x = n>=0 ? n : -n; Modint ans = 1, cnt = n>=0 ? *this : Modint(1) / *this; while(i <= x){ if(x & i){ ans *= cnt; x ^= i; } cnt *= cnt; i *= 2; } return ans; }
	inline constexpr operator ll() const { return _num; }
};
inline std::istream& operator>>(std::istream &s, Modint &x){ ll t; s>>t; x=t; return s; }
vector<Modint> fac(1, 1), inv(1, 1);
inline void reserve(size_t a){
	if(fac.size() >= a) return;
	if(a < fac.size() * 2) a = fac.size() * 2;
	if(a >= MOD) a = MOD;
	while(fac.size() < a) fac.push_back(fac.back() * ll(fac.size()));
	inv.resize(fac.size());
	inv.back() = Modint(1) / fac.back();
	for(ll i = inv.size() - 1; !inv[i - 1]; i--) inv[i - 1] = inv[i] * i;
}
inline Modint factorial(ll n){ if(n < 0) return 0; reserve(n + 1); return fac[n]; }
inline Modint nPk_loop(ll n, ll k){ if(n<k) return 0; Modint val(1); for(ll i=n;i>(n-k);i--)val*=i; return val; }
inline Modint nCk_loop(ll n, ll k){ if(n<k) return 0; Modint val(1); k=min(k,n-k); for(ll i=n;i>(n-k);i--)val*=i; for(ll i=k;i>1;i--)val/=i; return val; };
inline Modint nPk(ll n, ll k){ if(k < 0 || n < k) return 0; if(n>=(ll)1e7) return nPk_loop(n, k); reserve(n + 1); return fac[n] * inv[n - k]; }
inline Modint nCk(ll n, ll k){ if(k < 0 || n < k) return 0; if(n>=(ll)1e7) return nCk_loop(n, k); reserve(n + 1); return fac[n] * inv[k] * inv[n - k]; }
inline Modint nHk(ll n, ll k){ return nCk(n + k - 1, k); } //n種類のものから重複を許してk個選ぶ=玉k個と仕切りn-1個


//第1引数に定数を与える場合は LL をつけること
template<typename T1, typename T2> inline T1 power(T1 x, T2 n){
	if(n==0)return 1; else if(n==1)return x; else return power(x*x,n/2)*(n%2?x:1);
}
template<typename T1, typename T2> inline T1 power(T1 x, T2 n, ll mod){
	if(n==0)return 1; else if(n==1)return x; else return (power(x*x%mod,n/2,mod)*(n%2?x:1))%mod;
}


auto tmpf = [](ll n){
	n++;
	if(n<=0)return Modint(0);
	return  (Modint(10).pow(n) -1 ) / Modint(9);
};
auto calc=[](ll l, ll r, ll a){
	return ( tmpf(r-1)-tmpf(l-1) )*a;
};

//https://tsutaj.hatenablog.com/entry/2017/03/30/224339
template< typename Monoid, typename OperatorMonoid, typename F, typename G, typename H >
class SegmentTreeLazy {
public:
	ll sz;
	vector<Monoid> data;
	vector<OperatorMonoid> lazy;
	const F f;
	const G g;
	const H h;
	const Monoid M1;
	const OperatorMonoid OM0;

	SegmentTreeLazy(ll n, const F &f, const G &g, const H &h, const Monoid &M1, const OperatorMonoid &OM0)
	 : f(f), g(g), h(h), M1(M1), OM0(OM0) {
		sz = 1;
		while(sz < n) sz <<= 1;
		data.assign(sz*2, M1);
		lazy.assign(sz*2, OM0);
	}

	void update(ll L, ll R, OperatorMonoid val) {
		updateHelper(1, L, R, 0, sz, val);
	}

	Monoid query(ll L, ll R) {
		return queryHelper(1, L, R, 0, sz);
	}

	// 関数check を満たす/満たさない境目のindexを返す
	// 返却値 = 満たす要素数 = 満たさない最初のindex
	template<typename Func>
	ll partitionpoint(ll L, ll R, const Func &check){
		return partitionpointHelper(1, L, R, 0, sz, check);
	}

private:
	void eval(ll k, ll L, ll R) {
		if (lazy[k] != OM0) {
			//data[k] = g(data[k], lazy[k]);
			data[k] = calc(L,R,lazy[k]);//lazy[k];
			debug(L,R,lazy[k],data[k]);
			if (R - L > 1) {
				//lazy[k*2] = h(lazy[k*2], lazy[k]/2);//???
				//lazy[k*2+1] = h(lazy[k*2+1], lazy[k]/2);//???
				lazy[k*2] = lazy[k];//???
				lazy[k*2+1] = lazy[k];//???
			}
			lazy[k] = OM0;
		}
	}

	void updateHelper(ll k, ll a, ll b, ll L, ll R, OperatorMonoid val) {
		
		eval(k, L, R);

		if (b <= L || R <= a) return;
		
		if (a <= L && R <= b) {
			//lazy[k] = h(lazy[k], val*(R-L));//???
			lazy[k] = val;

			eval(k, L, R);
			return;
		}
		ll mid = L + (R - L) / 2;
		updateHelper(k*2, a, b, L, mid, val);//???
		updateHelper(k*2+1, a, b, mid, R, val);//???
		//Monoid sum1 = g(data[k*2], lazy[k*2]);
		//Monoid sum2 = g(data[k*2+1], lazy[k*2+1]);
		Monoid sum1 = data[k*2];
		Monoid sum2 = data[k*2+1];		
		data[k] = f(sum1, sum2);
	}
	
	Monoid queryHelper(ll k, ll a, ll b, ll L, ll R) {
		if (b <= L || R <= a) return M1;
		eval(k, L, R);
		if (a <= L && R <= b) return data[k];
		ll mid = L + (R - L) / 2;
		Monoid sum1 = queryHelper(k*2, a, b, L, mid);
		Monoid sum2 = queryHelper(k*2+1, a, b, mid, R);
		return f(sum1, sum2);
	}

	template<typename Func>
	ll partitionpointHelper(ll k, ll a, ll b, ll L, ll R, const Func &check) {
		eval(k, L, R);
		// 条件を満たす or [a,b)が[l,r)の範囲外 -> 一番右端を返す
		if (check(data[k]) || R <= a || b <= L) return R;
		// 自分が葉ならその位置をreturn
		if (L+1 == R) return L;
		ll mid = L + (R - L) / 2;
		ll index = partitionpointHelper(k*2, a, b, L, mid, check);
		if (index != mid) return index;
		return partitionpointHelper(k*2+1, a, b, mid, R, check);
	}
};
template< typename Monoid, typename OperatorMonoid, typename F, typename G, typename H >
std::ostream& operator<<(std::ostream& s, SegmentTreeLazy<Monoid,OperatorMonoid,F,G,H>& seg) { 
	for(ll i=0; i<seg.sz; i++) s << seg.query(i,i+1) << "\t\n"[i==seg.sz-1];
	return s;
}


/*-----8<-----library-----8<-----*/

constexpr ll N_MAX = 200'000;
constexpr ll Q_MAX = 200'000;
constexpr ll D_I_MAX = 9;
//constexpr ll MOD = 998'244'353;

ll N, Q;
vector<ll> L;
vector<ll> R;
vector<ll> D;

void solve() {
	cin >> N >> Q;
	L = vector<ll>(Q);
	R = vector<ll>(Q);
	D = vector<ll>(Q);
	rep(i, Q) { cin >> L[i] >> R[i] >> D[i]; L[i]--;}

	//ll ans = 0;
	repeq(i,3)debug(tmpf(i));

	repeq(i,3)debug(calc(3,5,i));

	auto F = [](ll x,ll y){return x+y;};
	SegmentTreeLazy<Modint,Modint,decltype(F),decltype(F),decltype(F)> seg(N, F, F, F, 0LL, 0LL);
	rep(i,N)seg.update(i,i+1,1);
	debug(seg.data);
	debug(seg.lazy);


	ll t=seg.query(0,N);
	debug(t);

	rep(i,Q){
		debug(N-R[i],N-R[i]+1);
		seg.update(N-R[i],N-L[i],D[i]);
		ll t=seg.query(0,N);
		p(t);
	}
	//cout << ans << '\n';
}

// https://atcoder.jp/contests/abl/tasks/abl_e
signed main() {
	std::cin.tie(nullptr);
	std::ios::sync_with_stdio(false);
	//ll Q; cin >> Q; while(Q--)solve();
	solve();
	return 0;
}


Measured memory_bytes: 16140