1352A.cpp

// Author : Mars_Coder
// https://codeforces.com/problemset/problem/1352/A

#define _USE_MATH_DEFINES
#include<bits/stdc++.h>
using namespace std;

#define ln              "\n" // no flush, oppos of endl
#define _flush          endl
#define stop_sync       ios::sync_with_stdio(false) // not to use c-style io
#define untie_ios       cin.tie(nullptr) // no flush
#define lli             long long int
#define vi              vector<int>
#define vii             vector<lli>
#define vch             vector<char>
#define double          long double
#define vss             vector<string>
#define vpp(T1, T2)     vector<pair<T1, T2>>
#define pq              priority_queue // high prec.
#define pqq(T)          priority_queue<T, vector<T>, greater<T>> 			
#define pb              push_back
#define ppb 	        pop_back
#define mp              make_pair
#define Fi(p)           get<0>(p)
#define Sc(p)           get<1>(p)
#define sz(x)           int ((x).size())
#define all(x)          (x).begin(), (x).end()
#define scanv(x)        for(auto &i: x) cin >> i
#define bin_sc(a, x)    binary_search(all(a), x)
#define lbd(a, x)       lower_bound(all(a), x) // an iter.
#define ubd(a, x)       upper_bound(all(a), x) // an iter.
#define eq_seg(a, x)    equal_range(all(a), x) // a pair of lb, ub
#define minE(a)         (*min_element(all(a)))
#define maxE(a)         (*max_element(all(a)))
#define FIXED(x)        cout << fixed << setprecision(x)
#define mem(a, v)       memset(a, v, sizeof a) // 0,-1 for int, and all char
#define filla(a, n, v)  fill(a, a + n, v) // for arr.
#define fillv(a, v)     fill(all(a), v) // for vec.
#define _fillv(a, n, v) fill_n(a.begin(), n, v)
#define glue(x, y)      x##y
#define print(x)        cout << (#x) << ": " << (x) << ln
#define printv(v)       for(auto i: v) cout << i << ' '; cout << ln
#define printvv(v)      for(auto i: v) {for(auto j: i) cout << j << ' '; cout << ln;}
#define printm(m)       for(auto i: m) cout << Fi(i) << " -> " << Sc(i) << ln
#define prints(s)       for(auto i: s) cout << i << ' '; cout << ln
#define uceil(a, b)     ((a + b - 1) / (b))
#define gcd(a, b)       __gcd(a, b)

const string yms[]{"YES", "Yes", "yes"};
const string nms[]{"NO", "No", "no"};
const double PI = acos(-1.0L);
struct{const int i = (1e9) + 7; const lli l = (lli)(1e9) + 7ll;}MOD;
struct{const int i = INT_MAX; const lli l = LLONG_MAX;}inf;
lli uround(lli a, lli b) {return (((a) * 1.0000) / (b) + 0.500000);}
lli pow2(lli p){return (1ll << p);}

// nxt templ.
// array<T, n> a = {}

int main(void){
	stop_sync;
	untie_ios;
	#ifndef ONLINE_JUDGE
		//freopen("generator.txt", "r", stdin);
		freopen("input.txt", "r", stdin);
		freopen("output.txt", "w", stdout);
		freopen("error.txt", "w", stderr);
	#endif
	
	int t(1);
	cin >> t; 
	while(t--){
		int n;
		cin >> n; 
		int now = 0;
		int nn = n;
		vi a;
		while(nn){
			if(nn % 10){
				a.pb(pow(10, now) * (nn % 10));
			}
			nn /= 10;
			++now;
		}
		cout << sz(a) << ln;
		printv(a);
	}
	return 0;
}


/*
some familiar issues & sugg.:
!----> [RE-READ THE CODE!]
!----> [invariants to array?]
!----> [look at global variables and their values]
!----> [llabs() for long long int type]
!----> [look at input size and time limit]
!----> [No sync with puts fn]
!----> [prefix vs suffix]
!----> [array contains duplicate values!]
!----> [(a/b+1)*b vs uceil(a,b)*b]

*/