#include<bits/stdc++.h>
#define rep(i,a,b) for(int i=(a);i<=(b);i++)
#define per(i,a,b) for(int i=(a);i>=(b);i--)
#define op(x) ((x&1)?x+1:x-1)
#define odd(x) (x&1)
#define even(x) (!odd(x))
#define lc(x) (x<<1)
#define rc(x) (lc(x)|1)
#define lowbit(x) (x&-x)
#define mp(x,y) make_pair(x,y)
typedef long long ll;
typedef unsigned long long ull;
typedef double db;
using namespace std;
const int MAXM = 1e4+10,MAXN = 1e6+10,N = 1e6,INF = 1e9;

ll T,k;

vector<ll> ans;

const ll val[6] = {-3,-2,-1,1,2,3};
typedef array<ll,6> node; //(-3,-2,-1,1,2,3)
node tmp;

struct vec{
	node state;
	ll w,x,y;

	bool operator<(const vec& v2)const{
		return w < v2.w;
	}
};
vec t[MAXM]; int tot;

ll r[10];

int dp[MAXN],pre[MAXN],pp[MAXN],C[20][20];

void rdfs(int now,int sum,int w,int& x,int& y){
	if(now == 6){
		if(sum == 0)x+=w;
		else if(sum == -1)y+=w;
		return;
	}
	rep(i,0,r[now]){
		rdfs(now+1,sum + i * val[now],w * C[r[now]][i],x,y);
	}
}

void dfs(int now,int sum){
	if(now == 6){ //新的 转移
		int x = 0,y = 0;

		rdfs(0,0,1,x,y);

		tot++; 
		rep(i,0,5)t[tot].state[i] = r[i];
		t[tot].w = sum; t[tot].x = x; t[tot].y = y;

		return;
	}
	rep(i,0,10){
		if(sum + i > 10)break;

		r[now] = i;
		dfs(now+1,sum+i);
	}
}

vector<int> path;

void solve(){
	cin>>k; ans.clear();

	path.clear(); while(k>1){
		path.push_back(pre[k]);
		k = pp[k];
	}
	reverse(path.begin(),path.end());

	ll P = 2,N = -1;
	ans.push_back(2); ans.push_back(-1);
	for(auto j : path){
		ll bv;
		if(P+N>0)bv = P;
		else bv = N;

		rep(i,0,5){
			rep(r,1,t[j].state[i]){
				ll w = val[i] * bv;
				if(w > 0)P += w;
				else N += w;

				ans.push_back(w);
			}
		}
	}

	cout<<ans.size()<<"\n";
	for(auto u : ans)cout<<u<<" ";cout<<"\n";
}

int main(){
	//freopen("zero.in","r",stdin);
	//freopen("zero.out","w",stdout);

	ios::sync_with_stdio(false); cin.tie(0);

	C[0][0] = 1;
	rep(i,1,19){
		C[i][0] = 1;
		rep(j,1,i)C[i][j] = C[i-1][j-1] + C[i-1][j];
	}

	dfs(0,0);

	sort(t+1,t+1+tot);
	
	rep(i,2,N)dp[i] = INF; dp[1] = 2;
	rep(i,1,N){
		rep(j,1,tot){
			if(dp[i] + t[j].w > 30)break;
			ll to = 1ll * i * t[j].x + t[j].y;
			if(to > N) continue;
			if(dp[to] > dp[i] + t[j].w){
				dp[to] = dp[i] + t[j].w;
				pre[to] = j;
				pp[to] = i;
			}
		}
	}

	cin>>T;
	while(T--)solve();

    return 0;
}