###### poj 1068
Parencodings
 Time Limit: 1000MS Memory Limit: 10000K

Description

Let S = s1 s2...s2n be a well-formed string of parentheses. S can be encoded in two different ways:
q By an integer sequence P = p1 p2...pn where pi is the number of left parentheses before the ith right parenthesis in S (P-sequence).
q By an integer sequence W = w1 w2...wn where for each right parenthesis, say a in S, we associate an integer which is the number of right parentheses counting from the matched left parenthesis of a up to a. (W-sequence).

Following is an example of the above encodings:
	S		(((()()())))

P-sequence	    4 5 6666

W-sequence	    1 1 1456



Write a program to convert P-sequence of a well-formed string to the W-sequence of the same string.

Input

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.

Output

The output file consists of exactly t lines corresponding to test cases. For each test case, the output line should contain n integers describing the W-sequence of the string corresponding to its given P-sequence.

Sample Input

2
6
4 5 6 6 6 6
9
4 6 6 6 6 8 9 9 9


Sample Output

1 1 1 4 5 6
1 1 2 4 5 1 1 3 9



1.p序列：当出现匹配括号对时，从该括号对的右括号开始往左数，直到最前面的左括号数，就是pi的值。

2.w序列：当出现匹配括号对时，包含在该括号对中的所有右括号数（包括该括号对,就是wi的值。

#### [ACM] POJ 1068 Parencodings(模拟）

2014-07-14 16:29:07

#### POJ1068解题报告

2011-02-08 16:17:00

#### POJ-1068 Parencodings

2014-06-19 19:45:42

#### POJ1068Parencodings

2016-08-15 22:55:08

#### [POJ_1068]Parencodings

2015-06-11 16:05:59

#### poj1068 Parencodings【模拟】【刷题计划】

2017-11-18 15:31:21

#### POJ 1068（模拟）

2016-01-23 22:44:12

#### POJ 1068-Parencodings

2015-03-12 19:54:56

#### Parencodings（POJ_1068）

2016-01-22 08:31:57

#### 安装SQL的出现的1068错误

2005-06-29 16:22:00

poj 1068