#include <bits/stdc++.h>
using namespace std;
int m;
#define endl '\n'
#define N 1000010
vector<int> ans[N];
int f[N], g[N][2];
void out(vector<int>& a) {
  cout << a.size() << endl;
  for (auto i : a) {
    cout << i << ' ';
  }
  cout << endl;
}
void gun() {
  cin >> m;
  out(ans[m]);
}
int main() {
  ios::sync_with_stdio(false);
  cin.tie(nullptr);
  vector<int> a;
  mt19937 rnd(random_device{}() ^ 19260817);
  int n = 1e6, sum;
  const int orv = 22, fw = 6;
  st:
  a.clear();
  for (int i = 1; i <= orv; ++i) a.emplace_back(rnd() % fw + 1);
  memset(f, 0, sizeof(f));
  memset(g, 0x3f, sizeof(g));
  f[0] = 1;
  g[0][0] = g[0][1] = 0;
  sum = 0;
  for (int i = 0; i < orv; ++i) {
    for (int j = sum; ~j; --j) {
      f[j + a[i]] += f[j];
    }
    sum += a[i];
  }
  for (int i = sum / 2 + 1; i <= sum; ++i) {
    for (int j = f[i]; j <= n; ++j) {
      if (g[j][0] > g[j - f[i]][0] + 1) {
        g[j][0] = g[j - f[i]][0] + 1;
        g[j][1] = i;
      }
    }
  }
  int tot = 0;
  for (int i = 1; i <= n; ++i) {
    if (ans[i].empty() && orv + g[i - 1][0] <= 30) {
      ans[i] = a;
      for (int j = i - 1; j; j -= f[g[j][1]]) {
        ans[i].emplace_back(-g[j][1]);
      }
    }
    tot += ans[i].empty();
  }
  if (tot) goto st;
  int T;
  cin >> T;
  while (T--) {
    gun();
  }
  return 0;
}