Compression and Expansion

题意翻译

你有一个数字串，开始为空，每轮你可以进行下面两个操作中的一个： 1. 从末尾删除若干个数字（可以为 $0$ 个）然后把删除后的数字串的最后一个元素加一。 2. 将数字 $1$ 加入到数字串的末端。 现在告诉你你一共进行了 $n$ 次这样的操作，并且告诉你每一次操作完后数字串末尾的数字，让你找到一种可行的方案，并输出每次操作后的数字串。 翻译来自 @$\color{red}\texttt{Macesuted}$

题目描述

William is a huge fan of planning ahead. That is why he starts his morning routine by creating a nested list of upcoming errands. A valid nested list is any list which can be created from a list with one item "1" by applying some operations. Each operation inserts a new item into the list, on a new line, just after one of existing items $ a_1 \,.\, a_2 \,.\, a_3 \,.\, \,\cdots\, \,.\,a_k $ and can be one of two types: 1. Add an item $ a_1 \,.\, a_2 \,.\, a_3 \,.\, \cdots \,.\, a_k \,.\, 1 $ (starting a list of a deeper level), or 2. Add an item $ a_1 \,.\, a_2 \,.\, a_3 \,.\, \cdots \,.\, (a_k + 1) $ (continuing the current level). Operation can only be applied if the list does not contain two identical items afterwards. And also, if we consider every item as a sequence of numbers, then the sequence of items should always remain increasing in lexicographical order. Examples of valid and invalid lists that are shown in the picture can found in the "Notes" section.When William decided to save a Word document with the list of his errands he accidentally hit a completely different keyboard shortcut from the "Ctrl-S" he wanted to hit. It's not known exactly what shortcut he pressed but after triggering it all items in the list were replaced by a single number: the last number originally written in the item number. William wants you to help him restore a fitting original nested list.

输入输出格式

输入格式

Each test contains multiple test cases. The first line contains the number of test cases $ t $ ( $ 1 \le t \le 10 $ ). Description of the test cases follows. The first line of each test case contains a single integer $ n $ ( $ 1 \le n \le 10^3 $ ), which is the number of lines in the list. Each of the next $ n $ lines contains a single integer $ a_i $ ( $ 1 \le a_i \le n $ ), which is what remains of William's nested list. It is guaranteed that in each test case at least one fitting list exists. It is guaranteed that the sum of values $ n $ across all test cases does not exceed $ 10^3 $ .

输出格式

For each test case output $ n $ lines which represent a valid nested list, which could become the data provided to you by William. If there are multiple answers, print any.

输入输出样例

输入样例 #1

2
4
1
1
2
3
9
1
1
1
2
2
1
2
1
2

输出样例 #1

1
1.1
1.2
1.3
1
1.1
1.1.1
1.1.2
1.2
1.2.1
2
2.1
2.2

说明

In the second example test case one example of a fitting list is: 1 1.1 1.1.1 1.1.2 1.2 1.2.1 2 2.1 2.2 This list can be produced by using the sequence of operations shown below:  1. Original list with a single item $ 1 $ . 2. Insert item $ 2 $ by using the insertion operation of the second type after item $ 1 $ . 3. Insert item $ 1.1 $ by using the insertion operation of the first type after item $ 1 $ . 4. Insert item $ 1.2 $ by using the insertion operation of the second type after item $ 1.1 $ . 5. Insert item $ 1.1.1 $ by using the insertion operation of the first type after item $ 1.1 $ . 6. Insert item $ 1.1.2 $ by using the insertion operation of the second type after item $ 1.1.1 $ . 7. Insert item $ 1.2.1 $ by using the insertion operation of the first type after item $ 1.2 $ . 8. Insert item $ 2.1 $ by using the insertion operation of the first type after item $ 2 $ . 9. Insert item $ 2.2 $ by using the insertion operation of the second type after item $ 2.1 $ .

题意翻译

你有一个数字串，开始为空，每轮你可以进行下面两个操作中的一个： 1. 从末尾删除若干个数字（可以为 $0$ 个）然后把删除后的数字串的最后一个元素加一。 2. 将数字 $1$ 加入到数字串的末端。 现在告诉你你一共进行了 $n$ 次这样的操作，并且告诉你每一次操作完后数字串末尾的数字，让你找到一种可行的方案，并输出每次操作后的数字串。 翻译来自 @$\color{red}\texttt{Macesuted}$