Prime Factorization Problem Statement

Given several queries each containing a single integer 'N', the task is to find the prime factorization of each integer using a sieve method.

Example:

Input:

N = 12

Output:

2 2 3

Input:

The first line contains a single integer ‘T’, representing the number of test cases.
The first line of each test case contains a single integer 'Q', representing the number of queries.
The second line of each test case will contain 'Q' space-separated integers, representing the integers whose prime factorization you have to find. 

Output:

For each test case, print all the prime factors of 'N' in a single line separated by a single space. 
Output for each query will be printed in a separate line.
The order of the output for each query doesn't matter.
Output for each test case will be printed in a separate line. 

Constraints:

• 1 <= T <= 5
• 1 <= Q <= 10^5
• 2 <= N <= 10^6
• Time Limit: 1 sec.

Note

You are not required to print anything; it has already been taken care of. Just implement the function and return the answer.