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 C (GCC 9.2.1) (judge verdict: Wrong Answer)

#include <stdio.h>
#include <stdlib.h>


int main(void){
  _Bool flag=0;
    int i, j, s, N, Q, L, R, D;
    char S[200000];

    scanf("%d %d", &N, &Q);
    if(N>9)
      flag=1;
    for(i=0; i<N; i++)
        S[i]='1';
    for(; i<200000; i++)
        S[i]='\0';
    for(i=0; i<Q; i++){
        scanf("%d %d %d", &L, &R, &D);
        for(j=L-1; j<R; j++)
            S[j]='0'+D;
      if(flag){
        s=atoi(S);
          printf("%d/n", s%998244353);}
        else
        printf("%s\n", S);}

return 0;}