Topic background
Under compulsion of a coach, I'm actually a topic of Konjac! ! ! Out of the question! ! ! (I do not find too much water data qwq)
Good, JL said that a good title brought 100 fast
Title Description
First of all, give you an empty sequence length n (nonsense)
Then, you have a series of magical operation, well well, only one, that is:
LRKD: given a length equal to R-L + 1 arithmetic sequence, the first item is K, the tolerance is D, and each of which corresponds to the number of added a [L] ~ a [R ] is. That is: Let A [L] = A [L] + K, A [L +. 1] = A [. 1 + L] + K D + (Los copied without pretending title valley surface P1438)
This operation has m times.
I would also like to ask you a question :( n of course, is after m operations)
I.e. before 1, 2 and n-number .......
Input Format
The first two rows integer n, m, represents the number of columns and the length of the number of operations.
The next m-row, showing the operation, i.e. LRKD
Output Format
For each inquiry, output the answer, each answer per line. (That is, n rows)
Sample input and output
Input # 1
Output # 1