Johnny listens to music

Johnny loves to listen to music so much. Each day he decides to add, delete or listen to a music track on his laptop by doing one of the following operations:

Download a new track.
Delete the last downloaded track that is not deleted already.
Listen to the shortest track that is already on his laptop.
Each test case Johnny starts with an empty collection of tracks, at day Johnny decides which action to be taken depending on the value of R[i] 3. if R[i] 3 = 0 he listens to the shortest track on his laptop, if R[i] % 3 = 1 he deletes the last downloaded track that is not deleted already, if R[i] %3 = 2 he downloads a new track whose length is R[i] minutes. Your task is to compute the total number of minutes Johnny spends listening to music.

To keep the input small, it will be codified in the following way. You will be given an array h. Use the following pseudo-code on h to generate an array R.

input array: h
output array: R (of size n)
j := 0
m := size of h
for i := 0 to n-1
R[i] := h[j]
s := (j+1)m h[j] := ( ( h[j] ^ h[s] ) + 13 ) 835454957
j := s
This code, along with the constraints, ensures that the length of each track is between 0 and 835454956, inclusive. In the above code, % is the modulus operator and ^ is the bitwise XOR binary operator. If x and y are integers, (x ^ y) represents the bitwise XOR operation on them in C/C++ and Java.

Input Format

Input will start with T number of test cases. Each test case will consist of 2 lines the first line starts with 0 < n <= 10,000,000 (size of array R), 0 < m <= 50 (size of array h). The second line will contain M numbers 0 <= h[i] <= 835454956 which are the elements of array h.

Output Format

For each test case, output the result using the following format:

k. S

Where k is the test case number (starting at 1), a single period, a single space, and S is the total time in minutes spent by Johnny listening to music.

Sample Input


6 6

8 5 2 4 8 9

10 4

9 4 3 10

Sample Output

  1. 5

  2. 52

always getting TLE … if someone can suggest an algorithm for this prb

use precomputed cumulative minimums in a stack…

it would be nice if you could elaborate a little.

maintain an array of size n(say min[n])

iterate from 0 to n

if R[i]< R[i-1] min[i]=i

else min[i]=min[i-1]

this array min will store the index of the min value uptil i

now if you have to delete an element(most recent) just move the pointer one step back

for addition keep maintaining the min array