#include <bits/stdc++.h>
#define ll long long
#define all(x) x.begin(), x.end()
constexpr int mod = 1e9 + 7, oo = 0x3f3f3f3f, N = 200006;
using namespace std;

inline bool cmp(const int* f, const int* g, int n) {
  for (int i = n - 1;i >= 0;--i) {
    if (f[i] == g[i]) continue;
    return f[i] < g[i];
  }
  return true;
}

int a[N], b[27][N], d[27];
int cnt, len, blen;

void doWork() {
  cnt = 0;
  string str;
  cin >> str;
  int n = str.size();
  for (int i = 0;i < n;++i) a[i] = str[n - i - 1] - '0';
  while (n > 1) {
    if (n == 2 && a[1] == 1) {
      if (a[0] == 0) d[cnt] = 1, b[cnt][0] = 9, a[0]++;
      else d[cnt] = 2, b[cnt][0] = b[cnt][1] = 1, a[0]--;
      a[1] = 0;
      ++cnt;
      break;
    }
    blen = n;
    len = (n & 1) ? (n >> 1) + 1 : n >> 1;
    for (int i = 0;i < len;++i) b[cnt][i] = b[cnt][n - i - 1] = a[n - i - 1];

    if (!cmp(b[cnt], a, n)) {
      int pt = len;
      while (a[n - pt] == 0) --pt;
      if (pt > 1) b[cnt][pt - 1] = b[cnt][n - pt] = a[n - pt] - 1;
      else {
        blen = n - 1;
        for (int i = 0;i < blen;++i) b[cnt][i] = 9;
        b[cnt][n - 1] = 0;
      }
    }
    for (int i = blen - 1;i >= 0;--i) a[i] -= b[cnt][i];
    for (int i = 0;i < n;++i) {
      if (a[i] >= 0) continue;
      a[i + 1]--;
      a[i] += 10;
    }
    while (a[n - 1] == 0 && n > 1) n--;
    d[cnt++] = blen;
  }
  cout << cnt + (a[0] > 0) << '\n';
  for (int i = 0;i < cnt;++i) {
    for (int j = d[i] - 1;j >= 0;--j) cout << b[i][j];
    cout << '\n';
  }
  if (a[0] > 0) cout << a[0] << '\n';
}
int main() {
  ios_base::sync_with_stdio(false);
  cout.tie(nullptr);
  cin.tie(nullptr);
  // freopen("input.txt", "r", stdin);
  // freopen("output.txt", "w", stdout);
  int t = 1;
  cin >> t;
  while (t--) {
    doWork();
    // cout << '\n';
  }
  return 0;
}