Andre has quite certain preferences. As of late he began becoming hopelessly enamored with clusters. Andre calls a nonempty cluster b great, if amount of its components is distinguishable by the length of this exhibit. For instance, cluster [2,3,1] is acceptable, as amount of its components — 6 — is distinguishable by 3, yet exhibit [1,1,2,3] isn't acceptable, as 7 isn't separable by 4.
Correct answer will be upvoted else Multiple Downvoted. Don't submit random answer. Computer science.
Andre has quite certain preferences. As of late he began becoming hopelessly enamored with clusters.
Andre calls a nonempty cluster b great, if amount of its components is distinguishable by the length of this exhibit. For instance, cluster [2,3,1] is acceptable, as amount of its components — 6 — is distinguishable by 3, yet exhibit [1,1,2,3] isn't acceptable, as 7 isn't separable by 4.
Andre considers a cluster an of length n great if the accompanying conditions hold:
Each nonempty subarray of this cluster is acceptable.
For each I (1≤i≤n), 1≤
Given a positive integer n, output any ideal cluster of length n. We can show that for the given limitations such a cluster consistently exists.
A cluster c is a subarray of an exhibit d if c can be gotten from d by cancellation of a few (conceivably, zero or all) components from the start and a few (perhaps, zero or all) components from the end.
Input
Each test contains different experiments. The main line contains the number of experiments t (1≤t≤100). Depiction of the experiments follows.
The sole line of each experiment contains a solitary integer n (1≤n≤100).
Output
For each test, output any ideal exhibit of length n on a different line.
Step by step
Solved in 4 steps with 1 images
