Problem:
Score : 500 points

Problem Statement

You have a string S of length N.
Initially, all characters in S are 1s.

You will perform queries Q times.
In the i-th query, you are given two integers L_i, R_i and a character D_i (which is a digit).
Then, you must replace all characters from the L_i-th to the R_i-th (inclusive) with D_i.

After each query, read the string S as a decimal integer, and print its value modulo 998,244,353.

Constraints

1 \leq N, Q \leq 200,000

1 \leq L_i \leq R_i \leq N

1 \leq D_i \leq 9

All values in input are integers.

Input

Input is given from Standard Input in the following format:

N Q
L_1 R_1 D_1
:
L_Q R_Q D_Q

Output

Print Q lines.
In the i-th line print the value of S after the i-th query, modulo 998,244,353.

Sample Input 1

8 5
3 6 2
1 4 7
3 8 3
2 2 2
4 5 1

Sample Output 1

11222211
77772211
77333333
72333333
72311333

Sample Input 2

200000 1
123 456 7

Sample Output 2

641437905

Don't forget to take the modulo.

Solution in Python (3.8.2) (judge verdict: Wrong Answer)

N, Q = map(int, input().split())
N_list = [1]* N
num_list = []
temp = 0
num = 0
num_mod = 0
for i in range(Q):
    num_list.append(list(map(int, input().split())))
for j in range(Q):
    keta = 1
    for k in range(num_list[j][0]-1, num_list[j][1]):
        N_list[k] = num_list[j][2]
        print(N_list)
    num = 0
    temp = 0
    for l in range(N):
        temp = N_list[N-l-1] * keta
        num += temp
        keta *= 10
    num_mod = num % 998244353
    print(num_mod)