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

#define pb push_back
#define sz(x) int(x.size())
#define all(vec) vec.begin(), vec.end()
#define rall(vec) vec.rbegin(), vec.rend()
#define cin(v) for (auto& cn : v)  cin >> cn;
#define cout(v) for (auto &cn : v) cout << cn << " ";
#define MOD int(1e9+7)
// #define endl "\n"
 
typedef long long ll;
typedef unsigned long long ull;
typedef long double ld;

void Haidy()
{
    ios_base::sync_with_stdio(false), cin.tie(nullptr), cout.tie(nullptr);
#ifndef ONLINE_JUDGE
    //freopen("input.txt","r",stdin),freopen("output.txt","w",stdout);
#endif
}
 
void solve();
int main()
{
    Haidy();
    int t = 1;
    cin >> t;
    for(int i = 1;i<=t; i++)
    {
        solve();
    }
    return 0;
}
// int dx[] = {0, 0, 1, -1, 1, -1, 1, -1};
// int dy[] = {1, -1, 0, 0, 1, -1, -1, 1};

bool allNine(string s)
{
    for(auto &c : s)
        if(c != '9')
            return false;
    return true;
}

void solve()
{
    string s;
    cin >> s;
    int n = sz(s);
    for(int len = 1; len <= 5; len++){
        int l = len;
        bool ok = true;
        int prev = 0, cnt = 0, missing = 0, cnt2 = 0;
        for(int i = 0; i < n; i += l){
            if(allNine(to_string(prev)))
                l++;
            if(i + l <= n){
                string sub = s.substr(i, l);
                while(sub[0] == '0' && l+1 <= 5 && l + 1 <= n){
                    sub = s.substr(i, l+1);
                    l++;    
                }
                if(!prev)
                    prev = stoi(sub);
                else{
                    int cur = stoi(sub);
                    while((cur < prev || sub[0] == '0') && l+1 <= 5 && l + 1 <= n){
                        sub = s.substr(i, l+1);
                        l++;    
                    }
                    cur = stoi(sub);
                    if(cur-prev > 1){
                        cnt++;
                        cnt2 = cur - prev - 1;
                        missing = prev + 1;
                    }
                    if(cnt > 1 || cur - prev <= 0 || sub[0] == '0')
                        ok = false;
                    prev = cur;
                }
            }
            else{
                // cout << i << " " << l << "\n" ; 
                ok = false;
                break;
            }
            
        }
            
        if(ok && cnt <= 1){
            cout << cnt2 << endl;
            for(int i = 0; i < cnt2; i++){
                cout << missing+i << " ";
            }
            return;
        }
    }
}