The first line contains two positive integers, N (1 \leq N \leq 200,000) and Q (1 \leq Q \leq 100,000).

The next line contains N nonnegative integers, each at most 100,000, indicating how many haybales are initially in each field.

Each of the next Q lines contains a single uppercase letter, either M, P or S, followed by either two positive integers A and B (1 \leq A \leq B \leq N), or three positive integers A, B, and C (1 \leq A \leq B \leq N; 1 \leq C \leq 100,000). There will be three positive integers if and only if the uppercase letter is P.

If the letter is M, print the minimum number of haybales in the interval of fields from A \ldots B.

If the letter is P, put C new haybales in each field in the interval of fields from A \ldots B.

If the letter is S, print the total number of haybales found within interval of fields from A \ldots B.

#3940 upload 23 done 8 how_to_reg 7

Counting Haybales timer 2s memory 512MB

#3940

Counting Haybales 2s 512MB