#include<bits/stdc++.h>
using namespace std ;
typedef long long ll ;
typedef unsigned long long ull ;
typedef pair < int , int > pii ;
typedef vector<int> vi;
#define fi first
#define se second
mt19937 rng(chrono::high_resolution_clock::now().time_since_epoch().count());

#define rep(i, a, b) for(int i = a; i < (b); ++i)
#define all(x) begin(x), end(x)
#define sz(x) (int)(x).size()

int n ;
vector < int > v ;

vector < int > sub ( vector < int > up , vector < int > down ) {
    vector < int > ret ;
    reverse ( up.begin ( ) , up.end ( ) ) ;
    reverse ( down.begin ( ) , down.end ( ) ) ;
    while ( down.size ( ) < up.size ( ) ) { down.push_back ( 0 ) ; }
    int sz = up.size ( ) ;
    for ( int i = 0 ; i < sz ; ++ i ) {
        ret.push_back ( up[ i ] - down[ i ] ) ;
        while ( ret.back ( ) < 0 ) {
            ret.back ( ) += 10 ;
            -- up[ i + 1 ] ;
        }
    }
    while ( ret.empty ( ) == false && ret.back ( ) == 0 ) { ret.pop_back ( ) ; }
    reverse ( ret.begin ( ) , ret.end ( ) ) ;
    return ret ;
}

vector < vector < int > > ans ;

void solve ( ) {
    ans.clear ( ) ;
    string foo ; cin >> foo ;   
    n = foo.size ( ) ;
    v.clear ( ) ;
    for ( int i = 0 ; i < n ; ++ i ) {
        v.push_back ( ( foo[ i ] - '0' ) ) ;
    }
    while ( v.size ( ) > 0 ) {
        vector < int > cand ;
        n = v.size ( ) ;
        cand.resize ( n ) ;
        int mid = ( ( n - 1 ) / 2 ) ;
        for ( int i = 0 ; i <= mid ; ++ i ) {
            cand[ i ] = v[ i ] ;
        }
        for ( int i = mid + 1 ; i < n ; ++ i ) {
            cand[ i ] = cand[ n - i - 1 ] ;
        }
        bool ok = true ;
        for ( int i = 0 ; i < n ; ++ i ) {
            if ( cand[ i ] == v[ i ] ) { continue ; }
            if ( cand[ i ] > v[ i ] ) { ok = false ; }
            break ;
        }
        if ( ok == false ) {
            int pos = -1 ;
            for ( int i = mid ; i >= 0 ; -- i ) {
                if ( cand[ i ] > 0 ) { pos = i ; break ; }
            }
            if ( pos == 0 && cand[ 0 ] == 1 ) {
                cand.clear ( ) ;
                for ( int i = 0 ; i < n - 1 ; ++ i ) { cand.push_back ( 9 ) ; }
            }
            else {
                -- cand[ pos ] ;
                if ( pos != n - pos - 1 ) { 
                    -- cand[ n - pos - 1 ] ;
                }
                for ( int i = pos + 1 ; i < n - pos - 1 ; ++ i ) {
                    cand[ i ] = 9 ;
                }
            }
        }
        ans.push_back ( cand ) ;
        v = sub ( v , cand ) ;
    }
    int sz = ans.size ( ) ;
    cout << sz << "\n" ;
    for ( auto hh : ans ) {
        for ( auto x : hh ) {
            cout << x ;
        }
        cout << "\n" ;
    }
}


int main ( ) {
    ios_base :: sync_with_stdio ( false ) ;
    cin.tie ( NULL ) ;
    int t = 1 ; cin >> t ;
    while ( t -- ) { solve ( ) ; }
    return 0 ;
}