Shohag has an integer n. Please help him find an increasing integer sequence 1≤a1<a2<…<an≤100 such that aimod ^{\text{∗}} is satisfied over all pairs 1 \le i \lt j \le n.
It can be shown that such a sequence always exists under the given constraints.
^{\text{∗}}a \bmod b denotes the remainder of a after division by b. For example, 7 \bmod 3 = 1, 8 \bmod 4 = 0 and 69 \bmod 10 = 9.
The first line contains a single integer t (1 \le t \le 50) — the number of test cases.
The first and only line of each test case contains an integer n (2 \le n \le 50).
For each test case, print n integers — the integer sequence that satisfies the conditions mentioned in the statement. If there are multiple such sequences, output any.
236
2 7 8 2 3 32 35 69 95
In the first test case, the sequence is increasing, values are from 1 to 100 and each pair of indices satisfies the condition mentioned in the statement:
Note that you do not necessarily have to print the exact same sequence, you can print any other sequence as long as it satisfies the necessary conditions.
Name |
---|