Given a number N. The task is to print all its unique prime factors in increasing order.
The first line of input contains an integer T denoting the number of test cases. T testcases follow.
The first line of each test case is N.
For each testcase, in a new line, print all prime factors in increasing order separated by space.
1 ≤ T ≤ 10000
2 ≤ N ≤ 106
Testcase1: 2 and 5 are the only prime factors of 100.
If you have purchased any course from GeeksforGeeks then please ask your doubt on course discussion forum. You will get quick replies from GFG Moderators there.