Project Euler #24: Lexicographic permutations

_{This problem is a programming version of Problem 24 from projecteuler.net}

A permutation is an ordered arrangement of objects. For example, is one possible permutation of the word . If all of the permutations are listed alphabetically, we call it lexicographic order. The lexicographic permutations of are:

What is the lexicographic permutation of the word ?

Input Format

The first line contains an integer , i.e., number of test cases.
Next lines will contain an integer .

Constraints

Output Format

Print the values corresponding to each test case.

Sample Input

2
1
2

Sample Output

abcdefghijklm
abcdefghijkml