#include<bits/stdc++.h>
#define LL long long
#define pb push_back
#define SZ(x) ((int)x.size()-1)
#define ms(a,b) memset(a,b,sizeof a)
#define F(i,a,b) for (int i=(a);i<=(b);++i)
#define DF(i,a,b) for (int i=(a);i>=(b);--i)
//#define mp make_pair
//#define OO(x) fixed<<setprecision(x)
using namespace std;
//mt19937 rnd(chrono::steady_clock::now().time_since_epoch().count());
inline int read(){
	char ch=getchar(); int w=1,c=0;
	for(;!isdigit(ch);ch=getchar()) if (ch=='-') w=-1;
	for(;isdigit(ch);ch=getchar()) c=(c<<1)+(c<<3)+(ch^48);
	return w*c;
}
int k,A,B;
void check(vector<LL> s,bool fl){
	int ret=0; A=0; B=0;
	F(i,0,(1<<s.size())-1){
		LL t=0;
		F(j,0,SZ(s)){
			if (i>>j&1){
				t+=s[j];
			}
		}
		if (t==0) ret++;
		if (t==-1) B++;
	}
	A=ret;
	if (fl) cerr<<ret<<"  subsets\n"; 
}
vector<LL> h[200][200];
void dfs(int dep,int la,int sm,vector<LL> s){
	if (sm>=0){	
		check(s,0);
		if (!h[A][B].size()) h[A][B]=s;
		else{
			if (s.size()<h[A][B].size()) h[A][B]=s;
		}
	}
	else{
		if (la<=0) return ;
	}
//	cerr<<dep<<" "<<s.size()<<" "<<la<<" "<<sm<<"\n";
	if (dep==10) return ;
	DF(i,la,-5){
		if (!i) continue;
		vector<LL> t=s; t.pb(i);
		dfs(dep+1,i,sm+i,t);
	}
}
const int M=1e6+10;
vector<LL> ans,s[M];
int dis[M],fr[M];
bool in[M];
int q[M*10];
void dij(){
	int lim=1000000;
	F(i,1,lim) dis[i]=lim;
	dis[1]=1; in[1]=1; int l=1,r=1; q[1]=1;
	while (l<=r){
		int x=q[l++]; in[x]=0;
		F(i,2,56){
			F(j,0,64){
				if (x*i+j>lim) break; 
				if (h[i][j].size() && x*i+j<=lim && dis[x*i+j]>dis[x]+h[i][j].size()){
					dis[x*i+j]=dis[x]+h[i][j].size();
					fr[x*i+j]=x;
					s[x*i+j]=h[i][j];
//					if (x*i+j==120){
//						cerr<<i<<" "<<j<<"???\n";
//					}
					if (!in[x*i+j]){
						in[x*i+j]=1;
						q[++r]=x*i+j;
					}
				}
			}
		}
	}
	cerr<<r<<"\n";
	F(i,1,lim){
//		cerr<<i<<" "<<dis[i]<<"\n";
		if (dis[i]>30){
			cerr<<i<<" "<<dis[i]<<"\n";
			break;
		}
	}
}
LL ps;
void con(int x){
	if (x==1){
		ans.pb(1); ps++;
		return ;
	}
	con(fr[x]);
	LL ad=0;
	for (LL o:s[x]){
		ans.pb(o*ps);
		if (o>0) ad+=o;
	}
	ps+=ad*ps;
}
int main(){
//	freopen(".in","r",stdin);
//	freopen(".out","w",stdout);
	dfs(1,5,0,{});
	cerr<<" finish \n"; 
	dij();
//	F(i,0,7){
//		cerr<<h[8][i].size()<<"\n";
//	}
//	return 0;
	int T=read();
	while (T--){
		ans.clear(); ps=0;
		k=read();
		con(k);
		cout<<ans.size()<<"\n";
		for (LL x:ans){
			cout<<x<<" ";
		}
		cout<<"\n";
	}
	
//	check(ans,1);
	return 0;
	if (k==1){
		cout<<"1 1\n";
		return 0;
	}
	int hi=0;
	DF(i,30,0){
		if (k>>i&1){
			hi=i;
			break;
		}
	}
	ans.pb(1);
	LL pos=1;
	check(ans,1);
	DF(i,hi-1,0){
		
		if (k>>i&1){
			ans.pb(pos);
//			ans.pb(2*pos);
			ans.pb(-pos);
			pos+=pos; 
		}
		else{
			ans.pb(pos*2);
//			ans.pb(pos*4);
			ans.pb(-pos*2);
			pos+=2*pos;
		}
	}
//	check(ans);
	cerr<<ans.size()<<"\n";
	return 0;
}
/* stuff you should look for
	* int overflow, array bounds
	* special cases (n=1?)
	* do smth instead of nothing and stay organized
	* WRITE STUFF DOWN
	* DON'T GET STUCK ON ONE APPROACH
*/