Pseudo ordering

We define b is a Divisor of a number a if a is divisible by b. So, the divisors of 12 are 1, 2, 3, 4, 6, 12. So, 12 has 6 divisors. Now you have to order all the integers from 1 to 1000. x will come before y if 1) number of divisors of x is less than number of divisors of y 2) number of divisors of x is equal to number of divisors of y and x > y. Input Input starts with an integer T (Each cas