#include<bits/stdc++.h>
using namespace std;
mt19937 fxk(time(0));
inline int rnd(int x){return fxk()%x+1;}
inline int qread()
{
    int a=0,f=1;char ch=getchar();
    while(!isdigit(ch)){if(ch=='-')f=-1;ch=getchar();}
    while(isdigit(ch)){(a*=10)+=(ch^48);ch=getchar();}
    return a*f;
}
int T,K,n,sum,a[40],p[100010];
long long dp[100010];
inline bool cmp(int x,int y){return dp[x]>dp[y];}
inline void solve()
{
    K=qread();
    while(1)
    {
        memset(dp,0,(sum+1)<<3);
        memset(a,0,(n+1)<<2);
        sum=n=0;dp[0]=1;
        for(int i=1;i<=15;++i)
        {
            a[i]=rnd(5);sum+=a[i];
            for(int j=sum;j>=a[i];--j)dp[j]+=dp[j-a[i]];
        }
        for(int i=0;i<=sum;++i)p[i]=i;
        sort(p+1,p+sum+1,cmp);
        for(int i=16,lp=0;i<=30;++i)
        {
            if(dp[0]==K){n=i-1;break;}
            lp=1;
            while(dp[0]+dp[p[lp]]>K)++lp;
            if(lp>sum)break;
            a[i]=-p[lp];
            for(int j=0;j<=sum+a[i];++j)dp[j]+=dp[j-a[i]];
            sort(p+1,p+sum+1,cmp);
        }
        if(dp[0]==K)
        {
            if(!n)n=30;
            printf("%d\n",n);
            for(int i=1;i<=n;++i)printf("%d ",a[i]);puts("");
            return ;
        }
    }
    return ;
}
int main()
{
    T=qread();
    while(T--)solve();
    return 0;
}