You are given an integer $$$n$$$. Construct any string $$$s$$$ that has exactly $$$n$$$ distinct nonempty substrings. It can be shown that such a string always exists.
A string $$$t$$$ is a substring of a string $$$s$$$ if $$$t$$$ can be obtained from $$$s$$$ by the deletion of several (possibly zero) characters from the beginning and several (possibly zero) characters from the end.
For example, the string $$$aba$$$ has $$$5$$$ distinct nonempty substrings — $$$a$$$, $$$b$$$, $$$ab$$$, $$$ba$$$, and $$$aba$$$.
The first line of the input contains a single integer $$$t$$$ ($$$1\le t\le 500$$$) — the number of test cases.
Each test case consists of a single line containing an integer $$$n$$$ ($$$1\le n \le 2\cdot 10^5$$$) — the desired number of distinct nonempty substrings.
It is guaranteed that the sum of $$$n$$$ over all test cases does not exceed $$$2\cdot 10^5$$$.
For each test case, output a single line containing a string $$$s$$$ — a string $$$s$$$ consisting of lowercase letters with exactly $$$n$$$ distinct nonempty substrings. You do not need to minimize the length of $$$s$$$.
If there are multiple solutions, print any.
4511554
abahvwxyzabracadabra
For the second test case, $$$h$$$ only has one distinct nonempty substring — $$$h$$$, so the answer is $$$1$$$.
For the third test case, all substrings of $$$s$$$ are distinct, so there are $$$15$$$ distinct substrings in total.
