The first line of the input contains a single integer t (1 <= t <= 10), the number of test cases, followed by the input data for each test case. The first line of each test case is an integer n (1 <= n <= 20), and the second line is the P-sequence of a well-formed string. It contains n positive integers, separated with blanks, representing the P-sequence.

#include <iostream>

#include <cstdio>

#include <algorithm>

#include <cmath>

#include <stack>

#include <vector>

#include <queue>

#include <cstring>

#include <string>

#include <map>

#include <set>

using namespace std;

const int BufferSize = 1 << 16;

char buffer[BufferSize], *Head, *Tail;

inline char Getchar() {

    if(Head == Tail) {

        int l = fread(buffer, 1, BufferSize, stdin);

        Tail = (Head = buffer) + l;

    }

    return *Head++;

}

int read() {

    int x = 0, f = 1; char c = Getchar();

    while(!isdigit(c)){ if(c == '-') f = -1; c = Getchar(); }

    while(isdigit(c)){ x = x * 10 + c - '0'; c = Getchar(); }

    return x * f;

}

#define maxn 50

int n, S[maxn], top;

int main() {

	int T = read();

	while(T--) {

		n = read();

		int lst = 0; top = 0;

		for(int i = 1; i <= n; i++) {

			int x = read();

			for(int j = 1; j <= top; j++) S[j] += x - lst;

			for(int j = x - lst; j; j--) S[++top] = j;

			printf("%d%c", S[top--], i < n ? ' ' : '\n');

			lst = x;

		}

	}

	return 0;

}