Description

TA Penguin07 wants to play a game with N people. Initially, these N people are lined up and numbered from 1 to N.

TA Penguin07 will issue K commands, each time asking the person with number i to kill the person behind them.

However, Penguin07 has poor eyesight and cannot clearly see who has been killed from the long line. So, after each command issued by Penguin07, you need to tell Penguin07 who was killed.

If the command is invalid (that person has already been killed or there is no one behind that person), you should output "Penguin07 QQ" (with no quotes).

Input

The input start with T (1 ≤ T ≤ 5), means number of testcases.

Each testcase contains two lines.

The first line contains two integer N and K.

The second line contains K integers a₁, a₂, … , a_K,  a_i is i'th operation the person numbered a_i.

Input Constraints:

• 1 ≤ T ≤ 5
• 1 ≤ N, K ≤ 10⁶
• 1 ≤ a₁, a₂, ..., a_N ≤ N

Output

For every operation output the number of the person killed each time.

If operation is invalid, output "Penguin07 QQ"(with no quotes).

Sample Input  Download

Sample Output  Download

Tags

Discuss