#include <bits/stdc++.h>

using namespace std;
#define ll long long
#define ld long double
#define EPS 1e-9
#define all(x) x.begin(),x.end()
#define allr(x) x.rbegin(),x.rend()
#define yes cout << "YES" << '\n';
#define no cout << "NO" << '\n';
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
#define endl '\n'
#define PI acos(-1)
#define Ones(n) __builtin_popcount(n)
#define Onesl(n) __builtin_popcountll(n)
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;
const ll MOD = 1e9 + 7;
const ll N = 100 + 5;
const int OO = 0x3f3f3f3f;
const ll LOO = 0x3f3f3f3f3f3f3f3f;
int dx8[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy8[] = {-1, +1, +0, +0, +1, -1, +1, -1};
int dx4[] = {+0, +0, -1, +1};
int dy4[] = {-1, +1, +0, +0};

void Rokba() {
    cin.tie(nullptr), cout.tie(nullptr), cin.sync_with_stdio(false), cout.sync_with_stdio(false);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}
string s;
set<int> ans;
void validate(int start){
    int i = 0;
    int cur = start;
    int cnt = 0;
    int val = 0;
    while (i + to_string(cur).size() - 1 < s.size() && cnt < 2){
        string c = to_string(cur);
        if(s.substr(i, c.size()) != c){
            cnt++;
            val = cur;
            cur++;
            continue;
        }
        cur++;
        i += (int)c.size();
    }
    if(i == s.size()) {
        if (cnt == 0) {
            if (start > 1)ans.insert(start - 1);
            if (cur <= 99999)ans.insert(cur);
        } else if (cnt == 1) {
            ans.insert(val);
        }
    }
}

void Solution() {
    // brute force on [a]
    // a is deleted
    // b is deleted
    // [a]    []    [b]
    ans.clear();
    int val = 0;
    cin >> s;
    for (int i = 0; i < min(5, (int)s.size()); ++i) {
        val *= 10;
        val += s[i] - '0';
        validate(val);
    }
    cout << ans.size() << '\n';
    for(auto f : ans){
        cout << f << " ";
    }
    cout << '\n';
}

int main() {
    Rokba();
    int T = 1;
    cin >> T;
    while (T--) {
        Solution();
    }
}