#include <bits/stdc++.h>
using namespace std;
const long long INF = 1000000000000000;
const long long MOD = 998244353;
void needForSpeed() {
  ios_base::sync_with_stdio(0);
  cin.tie(0);
  cout.tie(0);
}
long long gcd(long long a, long long b) {
  while (b) {
    a %= b;
    swap(a, b);
  }
  return a;
}
long long lcm(long long a, long long b) { return a / gcd(a, b) * b; }
bool isPrime(long long a) {
  if (a < 2) return 0;
  for (long long i = 2; i <= sqrt(a); i++)
    if (a % i == 0) return 0;
  return 1;
}
int solve() {
  string s;
  cin >> s;
  vector<int> ans;
  for (int i = s.length() - 1; i > -1; i--) {
    if (s[i] != '0') ans.push_back((s[i] - '0') * pow(10, s.length() - 1 - i));
  }
  cout << ans.size() << '\n';
  for (int v : ans) cout << v << " ";
  cout << '\n';
  return 0;
}
int main() {
  needForSpeed();
  int tests = 1;
  cin >> tests;
  while (tests--) {
    solve();
  }
  return 0;
}
