NWERC11C - Movie collection

Movie collection

Mr. K. I. has a very big movie collection. He has organized his collection in a big stack. Whenever he wants to watch one of the movies, he locates the movie in this stack and removes it carefully, ensuring that the stack doesn’t fall over. After he finishes watching the movie, he places it at the top of the stack.

Since the stack of movies is so big, he needs to keep track of the position of each movie. It is sufficient to know for each movie how many movies are placed above it, since, with this information, its position in the stack can be calculated. Each movie is identified by a number printed on the movie box.

Your task is to implement a program which will keep track of the position of each movie. In particular, each time Mr. K. I. removes a movie box from the stack, your program should print the number of movies that were placed above it before it was removed.



On the first line a positive integer: the number of test cases, at most 100. After that per test case:

  • one line with two integers m and r (1 ≤ m,r ≤ 100 000): the number of movies in the stack and the number of locate requests.
  • one line with r integers a1,,ar (1 ≤ aim) representing the identification numbers of movies that Mr. K. I. wants to watch.

For simplicity, assume that the initial stack contains the movies with identification numbers 1, 2,,m in increasing order, where the movie box with label 1 is the top-most box.



Per test case:

  • one line with r integers, where the i-th integer gives the number of movie boxes above the box with label ai, immediately before this box is removed from the stack.

Note that after each locate request ai, the movie box with label ai is placed at the top of the stack.


Sample in- and output



3 3
3 1 1
5 3
4 4 5
2 1 0
3 0 4

Copyright notice

This problem text is copyright by the NWERC 2011 jury. It is licensed under the Creative Commons Attribution-Share Alike license version 3.0; The complete license text can be found at: http://creativecommons.org/licenses/by-sa/3.0/legalcode

Added by:Jeroen Bransen
Time limit:2.630s
Source limit:50000B
Memory limit:1536MB
Cluster: Cube (Intel G860)
Languages:All except: ASM64
Resource:NWERC 2011 Jury

© Spoj.com. All Rights Reserved. Spoj uses Sphere Engine™ © by Sphere Research Labs.