// { Driver Code Starts

//Initial Template for Java

import java.io.*;

import java.util.*;

class GFG

{

public static void main(String args[])throws IOException

{

Scanner sc = new Scanner(System.in);

int t = sc.nextInt();

while(t-- > 0)

{

int N=sc.nextInt();

Solution ob = new Solution();

ArrayList<Integer> primes = ob.sieveOfEratosthenes(N);

for(int prime : primes) {

System.out.print(prime+" ");

}

System.out.println();

}

}

}

// } Driver Code Ends

//User function Template for Java

class Solution{

static ArrayList<Integer> sieveOfEratosthenes(int N){

// code here

ArrayList<Integer> numbers=new ArrayList<Integer>();

int i=0;

boolean isPrime[]=new boolean[N+1];

Arrays.fill(isPrime,true);

for(i=2;i*i<=N;i++){

if(isPrime[i]){

for(int j=2*i;j<=N;j=j+i)

isPrime[j]=false;

}

}

for(i=2;i<=N;i++){

if(isPrime[i])

numbers.add(i);

}

return numbers;

}

}