Problem p02538 (C++) — buggy submission, verdict: Time Limit Exceeded

// URL : https://atcoder.jp/contests/abl/tasks/abl_e
#pragma region optimize
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma endregion
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
#pragma region boost multiprecision
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint       = boost::multiprecision::cpp_int;
// using Bfloat32   =
// boost::multiprecision::number<boost::multiprecision::cpp_dec_float<32>>;
// using Bfloat1024 =
// boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;
#pragma endregion
// #define int long long
// #define endl '\\n'

#pragma region TEMPLATE
// clang-format off
/* TYPE */
typedef long long ll;       typedef long double ld;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<pii> vpii;   typedef vector<pll> vpll;
typedef vector<int> vi;     typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb;
typedef vector<ld> vld;     typedef vector<vector<int>> vvi;
template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;
template<typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\\n'
const int INF = 1 << 30;    const ll INFF = 1LL << 60;  const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;    const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9;    const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = { 1, 0, -1,  0,  1, -1, -1, 1, 0 };
const int dy[] = { 0, 1,  0, -1, -1, -1,  1, 1, 0 };
/* CONTAINER */
#define PB              emplace_back
#define ALL(v)          (v).begin(), (v).end()
#define RALL(v)         (v).rbegin(), (v).rend()
#define SORT(v)         sort(ALL(v))
#define RSORT(v)        sort(RALL(v))
#define LESS(x, val)    (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val)     (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val)     (int)(x).size() - LESS((x), (val))
#define UNIQUE(v)       sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n)      REPI(i, 0, n)
#define REPI(i, a, b)   for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...)        _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)
#define _RREP(i, n)     RREPI(i, n, 0)
#define RREPI(i, a, b)  for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...)       _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)
#define EACH(e, v)      for (auto& e : v)
#define PERM(v)         sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template<typename T> void SSS(T& t) { cin >> t; }
template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }
#define SS(T, ...)      T __VA_ARGS__; SSS(__VA_ARGS__);
#define SV(T, v, n)     vector<T> v(n); for (auto& i : v) cin >> i;
#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;
/* OUTPUT */
// Yes / No
inline int YES(bool x) { cout << (x ? "YES"  : "NO") << endl; return 0; }
inline int Yes(bool x) { cout << (x ? "Yes"  : "No") << endl; return 0; }
inline int yes(bool x) { cout << (x ? "yes"  : "no") << endl; return 0; }
inline int yES(bool x) { cout << (x ? "yES"  : "nO") << endl; return 0; }
inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; }
// PROTOTYPE DECLARATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }
template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}
template<size_t num = 0, typename... T> enable_if_t<num <  sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; }
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
// OUTPUT FUNCTION
template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \\n"[i == sz - 1]; return 0; }
inline int print() { cout << endl; return 0; }
template<typename Head> int print(Head&& head){ cout << head; return print(); }
template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }
#ifdef LOCAL
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do {cerr << __LINE__ << ":\\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi              first
#define se              second
#define MP              make_pair
#define MT              make_tuple
template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1)  r *= a; a *= a; } while (b >>= 1); return r; }
struct abracadabra {
    abracadabra() {
        cin.tie(nullptr); ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
        cerr << fixed << setprecision(5);
    };
} ABRACADABRA;
// clang-format on
#pragma endregion
#pragma region datastructure lazy segment tree
/**
 * @brief 遅延セグメント木
 * @docs docs/datastructure/segmenttree/lazysegmenttree.md
 */

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
struct LazySegmentTree {
  int sz;
  const M ID_M;
  const OM ID_OM;
  F f;
  G g;
  H h;
  P p;
  vector<M> dat;
  vector<OM> laz;
  LazySegmentTree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    build(n);
  }
  LazySegmentTree(const vector<M> &v, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    int n = v.size();
    build(n);
    for (int i = 0; i < n; ++i)
      dat[i + sz - 1] = v[i];
    for (int i = sz - 2; i >= 0; --i)
      dat[i] = f(dat[2 * i + 1], dat[2 * i + 2]);
  }
  void build(int n) {
    sz = 1;
    while (sz < n)
      sz <<= 1;
    dat.assign(2 * sz - 1, ID_M);
    laz.assign(2 * sz - 1, ID_OM);
  }
  void eval(int len, int k) {
    if (laz[k] == ID_OM)
      return;
    if (2 * k + 1 < 2 * sz - 1) {
      laz[2 * k + 1] = h(laz[2 * k + 1], laz[k]);
      laz[2 * k + 2] = h(laz[2 * k + 2], laz[k]);
    }
    dat[k] = g(dat[k], p(laz[k], len));
    laz[k] = ID_OM;
  }
  M update(int a, int b, OM x, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return dat[k];
    if (a <= l and r <= b) {
      laz[k] = h(laz[k], x);
      return g(dat[k], p(laz[k], r - l));
    }
    return dat[k] = f(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
                      update(a, b, x, 2 * k + 2, (l + r) / 2, r));
  }
  M update(int a, int b, OM x) { return update(a, b, x, 0, 0, sz); }
  M query(int a, int b, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return ID_M;
    if (a <= l and r <= b)
      return dat[k];
    M vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    M vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return f(vl, vr);
  }
  M query(int a, int b) { return query(a, b, 0, 0, sz); }
  M operator[](const int &k) { return query(k, k + 1); }
  void print() {
    for (int i = 0; i < sz; ++i)
      cerr << query(i, i + 1) << ' ';
    cerr << endl;
  }
};

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(n, ID_M, ID_OM, f, g, h, p);
}
template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(vector<M> v, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(v, ID_M, ID_OM, f, g, h, p);
}
#pragma endregion
#pragma region math modint
/**
 * @brief ModInt
 * @docs docs/math/modint.md
 */

template <int MODULO> struct ModInt {
  using i32 = int;
  using i64 = long long;
  using u32 = unsigned int;
  using u64 = unsigned long long;
  u64 x;
  ModInt() : x(0) {}
  ModInt(i64 y) : x(set(y % MODULO + MODULO)) {}
  static u64 set(const i64 &y) { return (y < MODULO) ? y : y - MODULO; }
  ModInt operator+(const ModInt &m) const { return ModInt(set(x + m.x)); }
  ModInt operator-(const ModInt &m) const {
    return ModInt(set(x + MODULO - m.x));
  }
  ModInt operator*(const ModInt &m) const { return ModInt(x * m.x % MODULO); }
  ModInt operator/(const ModInt &m) const { return ModInt(x) * ~ModInt(m.x); }
  ModInt &operator+=(const ModInt &m) { return *this = *this + m; }
  ModInt &operator-=(const ModInt &m) { return *this = *this - m; }
  ModInt &operator*=(const ModInt &m) { return *this = *this * m; }
  ModInt &operator/=(const ModInt &m) { return *this = *this / m; }
  ModInt &operator^=(const u64 &y) { return *this = *this ^ y; }
  ModInt operator~() const { return *this ^ (MODULO - 2); }
  ModInt operator-() const { return ModInt(set(MODULO - x)); }
  ModInt operator++() { return *this = ModInt(set(x + 1)); }
  ModInt operator--() { return *this = ModInt(set(x + MODULO - 1)); }
  bool operator<(const ModInt &m) const { return x < m.x; }
  bool operator>(const ModInt &m) const { return x > m.x; }
  bool operator==(const ModInt &m) const { return x == m.x; }
  bool operator!=(const ModInt &m) const { return x != m.x; }
  bool operator<=(const ModInt &m) const { return x <= m.x; }
  bool operator>=(const ModInt &m) const { return x >= m.x; }
  explicit operator u64() const { return x; }
  ModInt operator^(i64 y) const { return pow(x, y); }
  static ModInt pow(i64 x, i64 y) {
    bool neg = false;
    if (y < 0)
      y = -y, neg = true;
    ModInt u(1), t(x);
    while (y) {
      if (y & 1)
        u *= t;
      t *= t;
      y >>= 1;
    }
    return neg ? ModInt(1) / u : u;
  }
  friend ostream &operator<<(ostream &os, const ModInt<MODULO> &m) {
    return os << m.x;
  }
  friend istream &operator>>(istream &is, ModInt<MODULO> &m) {
    u64 y;
    is >> y;
    m = ModInt(y);
    return is;
  }
};
constexpr int MODULO = (int)1e9 + 7;
using modint = ModInt<MODULO>;
#pragma endregion

using mint = ModInt<MODD>;

int solve();

signed main() {
  // int _T; cin >> _T; for (int t = 1; t <= _T; ++t)
  solve();
}

int solve() {

  SS(int, N, Q);

  vector<mint> tens;
  tens.emplace_back(1);
  REP(i, 200020) {
    mint tmp = tens.back() * 10;
    tens.emplace_back(tmp);
  }

  vector<mint> ones;
  ones.emplace_back(0);
  ones.emplace_back(1);
  REP(i, 200020) {
    mint tmp = ones.back() * 10 + 1;
    ones.emplace_back(tmp);
  }

  // 位, 桁, 長さ
  using M = tuple<mint, mint, int>;
  using OM = int;
  auto f = [&](M a, M b) -> M {
    auto [a1, a2, a3] = a;
    auto [b1, b2, b3] = b;

    return M{b1, a2 * tens[b3] + b2, a3 + b3};
  };
  auto g = [&](M a, OM b) -> M {
    if (b == -1)
      return a;
    auto [a1, a2, a3] = a;
    return M{a1, ones[a3] * b, a3};
  };
  auto h = [](OM a, OM b) -> OM {
    if (b == -1)
      return a;
    return b;
  };
  auto p = [](OM a, int b) -> OM { return a; };

  vector<M> V;
  {
    mint cur = 1;
    REP(i, N) {
      V.emplace_back(M{cur, 1, 1});
      cur *= 10;
    }
    reverse(ALL(V));
  }

  auto seg = make_segtree(V, M{1, 0, 0}, OM{-1}, f, g, h, p);

  while (Q--) {
    SS(int, L, R, D);
    --L;
    seg.update(L, R, D);
    print(get<1>(seg.query(0, N)));
  }

  return 0;
}


Error: TLE

Fixed submission:

// URL : https://atcoder.jp/contests/abl/tasks/abl_e
#pragma region optimize
// #pragma GCC optimize("Ofast")
// #pragma GCC optimize("unroll-loops")
// #pragma GCC target("sse,sse2,sse3,ssse3,sse4,popcnt,abm,mmx,avx")
#pragma endregion
#include <bits/stdc++.h>
// #include <atcoder/all>
using namespace std;
#pragma region boost multiprecision
// #include <boost/multiprecision/cpp_dec_float.hpp>
// #include <boost/multiprecision/cpp_int.hpp>
// using Bint       = boost::multiprecision::cpp_int;
// using Bfloat32   =
// boost::multiprecision::number<boost::multiprecision::cpp_dec_float<32>>;
// using Bfloat1024 =
// boost::multiprecision::number<boost::multiprecision::cpp_dec_float<1024>>;
#pragma endregion
// #define int long long
// #define endl '\\n'

#pragma region TEMPLATE
// clang-format off
/* TYPE */
typedef long long ll;       typedef long double ld;
typedef pair<int, int> pii; typedef pair<ll, ll> pll;
typedef vector<pii> vpii;   typedef vector<pll> vpll;
typedef vector<int> vi;     typedef vector<ll> vl;
typedef vector<string> vst; typedef vector<bool> vb;
typedef vector<ld> vld;     typedef vector<vector<int>> vvi;
template<typename T, typename Cmp = less<>> using prique = priority_queue<T, vector<T>, Cmp>;
template<typename T> using prique_r = prique<T, greater<>>;
/* CONSTANT */
#define ln '\\n'
const int INF = 1 << 30;    const ll INFF = 1LL << 60;  const string ALPHABET = "ABCDEFGHIJKLMNOPQRSTUVWXYZ";
const int MOD = 1e9 + 7;    const int MODD = 998244353; const string alphabet = "abcdefghijklmnopqrstuvwxyz";
const double EPS = 1e-9;    const ld PI = 3.14159265358979323846264338327950288;
const int dx[] = { 1, 0, -1,  0,  1, -1, -1, 1, 0 };
const int dy[] = { 0, 1,  0, -1, -1, -1,  1, 1, 0 };
/* CONTAINER */
#define PB              emplace_back
#define ALL(v)          (v).begin(), (v).end()
#define RALL(v)         (v).rbegin(), (v).rend()
#define SORT(v)         sort(ALL(v))
#define RSORT(v)        sort(RALL(v))
#define LESS(x, val)    (lower_bound(x.begin(), x.end(), val) - x.begin())
#define LEQ(x, val)     (upper_bound(x.begin(), x.end(), val) - x.begin())
#define GREATER(x, val) (int)(x).size() - LEQ((x), (val))
#define GEQ(x, val)     (int)(x).size() - LESS((x), (val))
#define UNIQUE(v)       sort(ALL(v)); (v).erase(unique(ALL(v)), (v).end())
template<typename T> vector<T> make_v(size_t a) { return vector<T>(a); }
template<typename T, typename... Ts> auto make_v(size_t a, Ts... ts) { return vector<decltype(make_v<T>(ts...))>(a, make_v<T>(ts...)); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value != 0> fill_v(U &u, const V... v) { u = U(v...); }
template<typename T, typename U, typename... V> enable_if_t<is_same<T, U>::value == 0> fill_v(U &u, const V... v) { for (auto &e : u) fill_v<T>(e, v...); }
/* LOOP */
#define _overload3(_1, _2, _3, name, ...) name
#define _REP(i, n)      REPI(i, 0, n)
#define REPI(i, a, b)   for (ll i = (ll)a; i < (ll)b; ++i)
#define REP(...)        _overload3(__VA_ARGS__, REPI, _REP,)(__VA_ARGS__)
#define _RREP(i, n)     RREPI(i, n, 0)
#define RREPI(i, a, b)  for (ll i = (ll)a; i >= (ll)b; --i)
#define RREP(...)       _overload3(__VA_ARGS__, RREPI, _RREP,)(__VA_ARGS__)
#define EACH(e, v)      for (auto& e : v)
#define PERM(v)         sort(ALL(v)); for (bool c##p = true; c##p; c##p = next_permutation(ALL(v)))
/* INPUT */
template<typename T> void SSS(T& t) { cin >> t; }
template<typename Head, typename... Tail> void SSS(Head&& head, Tail&&... tail) { cin >> head; SSS(tail...); }
#define SS(T, ...)      T __VA_ARGS__; SSS(__VA_ARGS__);
#define SV(T, v, n)     vector<T> v(n); for (auto& i : v) cin >> i;
#define SVV(T, v, n, m) vector<vector<T>> v(n, vector<T>(m)); for (auto& r : v) for (auto& i : r) cin >> i;
/* OUTPUT */
// Yes / No
inline int YES(bool x) { cout << (x ? "YES"  : "NO") << endl; return 0; }
inline int Yes(bool x) { cout << (x ? "Yes"  : "No") << endl; return 0; }
inline int yes(bool x) { cout << (x ? "yes"  : "no") << endl; return 0; }
inline int yES(bool x) { cout << (x ? "yES"  : "nO") << endl; return 0; }
inline int Yay(bool x) { cout << (x ? "Yay!" : ":(") << endl; return 0; }
// PROTOTYPE DECLARATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j);
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t);
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)> = nullptr> ostream& operator<<(ostream &os, const C &c);
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j);
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j);
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j);
// IMPLEMENTATION
template<typename T, typename U> ostream &operator<<(ostream &os, const pair<T, U> &j) { return os << '{' << j.first << ", " << j.second << '}'; }
template<size_t num = 0, typename... T> enable_if_t<num == sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) {}
template<size_t num = 0, typename... T> enable_if_t<num <  sizeof...(T)> PRINT_TUPLE(ostream &os, const tuple<T...> &t) { os << get<num>(t); if (num + 1 < sizeof...(T)) os << ", "; PRINT_TUPLE<num + 1>(os, t); }
template<typename... T> ostream &operator<<(ostream &os, const tuple<T...> &t) { PRINT_TUPLE(os << '{', t); return os << '}'; }
template<class C, enable_if_t<!is_same<C, string>::value, decltype(declval<const C &>().begin(), nullptr)>> ostream& operator<<(ostream &os, const C &c) { os << '{'; for (auto it = begin(c); it != end(c); it++) { if (begin(c) != it) os << ", "; os << *it; } return os << '}'; }
template<typename T> ostream &operator<<(ostream &os, const stack<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
template<typename T> ostream &operator<<(ostream &os, const queue<T> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_back(c.front()); return os << d; }
template<typename T, typename C, typename Cmp> ostream &operator<<(ostream &os, const priority_queue<T, C, Cmp> &j) { deque<T> d; for (auto c = j; !c.empty(); c.pop()) d.push_front(c.top());  return os << d; }
// OUTPUT FUNCTION
template<typename T> int PV(T &v) { int sz = v.size(); for (int i = 0; i < sz; ++i) cout << v[i] << " \\n"[i == sz - 1]; return 0; }
inline int print() { cout << endl; return 0; }
template<typename Head> int print(Head&& head){ cout << head; return print(); }
template<typename Head, typename... Tail> int print(Head&& head, Tail&&... tail) { cout << head << " "; return print(forward<Tail>(tail)...); }
#ifdef LOCAL
inline void dump() { cerr << endl; }
template<typename Head> void dump(Head&& head) { cerr << head; dump(); }
template<typename Head, typename... Tail> void dump(Head&& head, Tail&&... tail) { cerr << head << ", "; dump(forward<Tail>(tail)...); }
#define debug(...) do {cerr << __LINE__ << ":\\t" << #__VA_ARGS__ << " = "; dump(__VA_ARGS__); } while (false)
#else
#define dump(...)
#define debug(...)
#endif
/* OTHER */
#define fi              first
#define se              second
#define MP              make_pair
#define MT              make_tuple
template<typename T, typename A, typename B> inline bool between(T x, A a, B b) { return ((a <= x) && (x < b)); }
template<typename A, typename B> inline bool chmax(A &a, const B &b) { if (a < b) { a = b; return true; } return false; }
template<typename A, typename B> inline bool chmin(A &a, const B &b) { if (a > b) { a = b; return true; } return false; }
inline ll gcd(ll a, ll b) { return b ? gcd(b, a % b) : a; }
inline ll lcm(ll a, ll b) { return a / gcd(a, b) * b; }
inline ll POW(ll a, ll b) { ll r = 1; do { if (b & 1)  r *= a; a *= a; } while (b >>= 1); return r; }
struct abracadabra {
    abracadabra() {
        cin.tie(nullptr); ios::sync_with_stdio(false);
        cout << fixed << setprecision(20);
        cerr << fixed << setprecision(5);
    };
} ABRACADABRA;
// clang-format on
#pragma endregion
#pragma region datastructure lazy segment tree
/**
 * @brief 遅延セグメント木
 * @docs docs/datastructure/segmenttree/lazysegmenttree.md
 */

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
struct LazySegmentTree {
  int sz;
  const M ID_M;
  const OM ID_OM;
  F f;
  G g;
  H h;
  P p;
  vector<M> dat;
  vector<OM> laz;
  LazySegmentTree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    build(n);
  }
  LazySegmentTree(const vector<M> &v, M ID_M, OM ID_OM, F f, G g, H h, P p)
      : ID_M(ID_M), ID_OM(ID_OM), f(f), g(g), h(h), p(p) {
    int n = v.size();
    build(n);
    for (int i = 0; i < n; ++i)
      dat[i + sz - 1] = v[i];
    for (int i = sz - 2; i >= 0; --i)
      dat[i] = f(dat[2 * i + 1], dat[2 * i + 2]);
  }
  void build(int n) {
    sz = 1;
    while (sz < n)
      sz <<= 1;
    dat.assign(2 * sz - 1, ID_M);
    laz.assign(2 * sz - 1, ID_OM);
  }
  void eval(int len, int k) {
    if (laz[k] == ID_OM)
      return;
    if (2 * k + 1 < 2 * sz - 1) {
      laz[2 * k + 1] = h(laz[2 * k + 1], laz[k]);
      laz[2 * k + 2] = h(laz[2 * k + 2], laz[k]);
    }
    dat[k] = g(dat[k], p(laz[k], len));
    laz[k] = ID_OM;
  }
  M update(int a, int b, OM x, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return dat[k];
    if (a <= l and r <= b) {
      laz[k] = h(laz[k], x);
      return g(dat[k], p(laz[k], r - l));
    }
    return dat[k] = f(update(a, b, x, 2 * k + 1, l, (l + r) / 2),
                      update(a, b, x, 2 * k + 2, (l + r) / 2, r));
  }
  M update(int a, int b, OM x) { return update(a, b, x, 0, 0, sz); }
  M query(int a, int b, int k, int l, int r) {
    eval(r - l, k);
    if (r <= a or b <= l)
      return ID_M;
    if (a <= l and r <= b)
      return dat[k];
    M vl = query(a, b, 2 * k + 1, l, (l + r) / 2);
    M vr = query(a, b, 2 * k + 2, (l + r) / 2, r);
    return f(vl, vr);
  }
  M query(int a, int b) { return query(a, b, 0, 0, sz); }
  M operator[](const int &k) { return query(k, k + 1); }
  void print() {
    for (int i = 0; i < sz; ++i)
      cerr << query(i, i + 1) << ' ';
    cerr << endl;
  }
};

template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(int n, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(n, ID_M, ID_OM, f, g, h, p);
}
template <typename M, typename OM, typename F, typename G, typename H,
          typename P>
auto make_segtree(vector<M> v, M ID_M, OM ID_OM, F f, G g, H h, P p) {
  return LazySegmentTree<M, OM, F, G, H, P>(v, ID_M, ID_OM, f, g, h, p);
}
#pragma endregion
#pragma region math modint
/**
 * @brief ModInt
 * @docs docs/math/modint.md
 */

template <int MODULO> struct ModInt {
  using i32 = int;
  using i64 = long long;
  using u32 = unsigned int;
  using u64 = unsigned long long;
  u64 x;
  ModInt() : x(0) {}
  ModInt(i64 y) : x(set(y % MODULO + MODULO)) {}
  static u64 set(const i64 &y) { return (y < MODULO) ? y : y - MODULO; }
  ModInt operator+(const ModInt &m) const { return ModInt(set(x + m.x)); }
  ModInt operator-(const ModInt &m) const {
    return ModInt(set(x + MODULO - m.x));
  }
  ModInt operator*(const ModInt &m) const { return ModInt(x * m.x % MODULO); }
  ModInt operator/(const ModInt &m) const { return ModInt(x) * ~ModInt(m.x); }
  ModInt &operator+=(const ModInt &m) { return *this = *this + m; }
  ModInt &operator-=(const ModInt &m) { return *this = *this - m; }
  ModInt &operator*=(const ModInt &m) { return *this = *this * m; }
  ModInt &operator/=(const ModInt &m) { return *this = *this / m; }
  ModInt &operator^=(const u64 &y) { return *this = *this ^ y; }
  ModInt operator~() const { return *this ^ (MODULO - 2); }
  ModInt operator-() const { return ModInt(set(MODULO - x)); }
  ModInt operator++() { return *this = ModInt(set(x + 1)); }
  ModInt operator--() { return *this = ModInt(set(x + MODULO - 1)); }
  bool operator<(const ModInt &m) const { return x < m.x; }
  bool operator>(const ModInt &m) const { return x > m.x; }
  bool operator==(const ModInt &m) const { return x == m.x; }
  bool operator!=(const ModInt &m) const { return x != m.x; }
  bool operator<=(const ModInt &m) const { return x <= m.x; }
  bool operator>=(const ModInt &m) const { return x >= m.x; }
  explicit operator u64() const { return x; }
  ModInt operator^(i64 y) const { return pow(x, y); }
  static ModInt pow(i64 x, i64 y) {
    bool neg = false;
    if (y < 0)
      y = -y, neg = true;
    ModInt u(1), t(x);
    while (y) {
      if (y & 1)
        u *= t;
      t *= t;
      y >>= 1;
    }
    return neg ? ModInt(1) / u : u;
  }
  friend ostream &operator<<(ostream &os, const ModInt<MODULO> &m) {
    return os << m.x;
  }
  friend istream &operator>>(istream &is, ModInt<MODULO> &m) {
    u64 y;
    is >> y;
    m = ModInt(y);
    return is;
  }
};
constexpr int MODULO = (int)1e9 + 7;
using modint = ModInt<MODULO>;
#pragma endregion

using mint = ModInt<MODD>;

int solve();

signed main() {
  // int _T; cin >> _T; for (int t = 1; t <= _T; ++t)
  solve();
}

int solve() {

  SS(int, N, Q);

  // 位, 桁, 長さ
  using M = tuple<mint, mint, int>;
  using OM = int;
  auto f = [](M a, M b) -> M {
    auto [a1, a2, a3] = a;
    auto [b1, b2, b3] = b;

    mint c = mint::pow(10, b3);
    return M{b1, a2 * c + b2, a3 + b3};
  };
  auto g = [](M a, OM b) -> M {
    if (b == -1)
      return a;
    auto [a1, a2, a3] = a;
    // a3桁の1
    mint c = (mint::pow(10, a3) - 1) / 9;
    return M{a1, c * b, a3};
  };
  auto h = [](OM a, OM b) -> OM {
    if (b == -1)
      return a;
    return b;
  };
  auto p = [](OM a, int b) -> OM { return a; };

  vector<M> V;
  {
    mint cur = 1;
    REP(i, N) {
      V.emplace_back(M{cur, 1, 1});
      cur *= 10;
    }
    reverse(ALL(V));
  }

  auto seg = make_segtree(V, M{1, 0, 0}, OM{-1}, f, g, h, p);

  while (Q--) {
    SS(int, L, R, D);
    --L;
    seg.update(L, R, D);
    print(get<1>(seg.query(0, N)));
  }

  return 0;
}