听灌佬多

#include<bits/stdc++.h>
using namespace std;
long long t,n;
void f(long long n,vector<long long> v,long long tmp){
	while(n>2){
		for(int i=1;i<=tmp;i++){
			if(i%2==0){
				v[i]=0;
			}
		}
		return f(n/2+n%2,v,tmp);
	}
	if(n<=2){
		return;
	}
}  
int main(){
	cin>>t;
	while(t--){
		cin>>n;
		if(n==1){
			cout<<1<<endl;
			continue;
		}
		else if(n==2){
			cout<<1<<" "<<2<<endl;
			continue;
		}
		vector<long long> v(n);
		for(int i=1;i<=n;i++){
			v[i]=i;
		}
		long long tmp=n;
		f(n,v,tmp); 
		for(int i=1;i<=tmp;i++){
			if(v[i]!=0){
				cout<<v[i]<<" ";
			}
		}
		cout<<endl;
	}
	return 0;
}