#include <bits/stdc++.h>

using namespace std;

typedef long long ll;
typedef long double ld;
typedef pair<int, int> pii;
typedef pair<ll, ll> pll;
typedef vector<int> vi;

#define fi first
#define se second
#define pp push_back
#define all(x) (x).begin(), (x).end()
#define Ones(n) __builtin_popcount(n)
#define endl '\n'
#define mem(arrr, xx) memset(arrr,xx,sizeof arrr)
//#define int long long
#define debug(x) cout << (#x) << " = " << x << endl

void Gamal() {
    ios_base::sync_with_stdio(false);
    cin.tie(nullptr);
#ifdef Clion
    freopen("input.txt", "r", stdin), freopen("output.txt", "w", stdout);
#endif
}

int dx[] = {+0, +0, -1, +1, +1, +1, -1, -1};
int dy[] = {-1, +1, +0, +0, +1, -1, +1, -1};

const double EPS = 1e-9;
const ll OO = 0X3F3F3F3F3F3F3F3F;
const int N = 5e5 + 5, INF = INT_MAX, MOD = 1e9 + 7, LOG = 20;

int dp[N][6][2], vis[N][6][2],vis2[N][6][2], vid;
string s;
set<int>ans;

int slv(int i,int lst,bool skip,int num){
    if(i == s.size()){
        return 1;
    }
    int &ret = dp[i][lst][skip];
    if(vis[i][lst][skip] == vid)
        return ret;
    vis[i][lst][skip] = vid;
    ret = 0;
    if(!skip)ret = slv(i,0,1,num + 1);
    int cur = 0;
    for (int j = i; j < min(i + 5,(int)s.size()); ++j) {
        cur = cur * 10 + s[j] - '0';
        if(!cur)break;
        if(cur == num + 1 || num < 1){
            ret |= slv(j + 1,j - i + 1,skip,cur);
        }
    }
    return ret;
}

void build(int i,int lst,bool skip,int num){
    if(i == s.size()){
        ans.insert(num);
        return;
    }
    if(vis2[i][lst][skip] == vid)
        return;
    vis2[i][lst][skip] = vid;
    int op = slv(i,lst,skip,num);
    if(!op)return;
    if(!skip && slv(i,0,1,num + 1)){
        build(i,0,1,num + 1);
    }
    int cur = 0;
    for (int j = i; j < min(i + 5,(int)s.size()); ++j) {
        cur = cur * 10 + s[j] - '0';
        if(!cur)break;
        if(cur == num + 1 || num < 1){
            if(skip){
                if(slv(j + 1,j - i + 1,skip,cur) && cur > 1)ans.insert(cur - 1);
            }
            else if(slv(j + 1,j - i + 1,skip,cur))
                build(j + 1,j - i + 1,skip,cur);
        }
    }
}



void solve() {
    ++vid;
    ans.clear();
    cin >> s;
    build(0, 0, false,-1e9);
    cout << ans.size() << endl;
    for(auto x:ans)cout << x << " ";
    cout << endl;
}


signed main() {
    Gamal();
    int t = 1;
    cin >> t;
    while (t--) {
        solve();
    }
}