Fractions
Easy
Execution time limit is 1 second
Runtime memory usage limit is 128 megabytes
For a given positive integer n print in ascending order all the proper irreducible fractions with denominators not exceeding n.
Input
The first line contains the number of test cases t (t ≤ 10). Each of the following t lines contains one integer n (1 < n ≤ 2000).
Output
For each test case print in ascending order all the proper irreducible fractions. Neighboring fractions should be separated by a comma and one space.
Examples
Input #1
Answer #1
Submissions 766
Acceptance rate 22%