#include <bits/stdc++.h>

using namespace std;

#define FOR(i, a, b) for(int i = (a); i < (b); i++)
#define RFOR(i, a, b) for(int i = (a) - 1; i >= (b); i--)
#define SZ(a) int(a.size())
#define ALL(a) a.begin(), a.end()
#define PB push_back
#define MP make_pair
#define F first
#define S second

typedef long long LL;
typedef vector<int> VI;
typedef vector<LL> VL;
typedef pair<int, int> PII;
typedef pair<LL, LL> PLL;
typedef double db;

VI check(string s, int a)
{
	//cerr << s << ' ' << a << '\n';
	VI skipped;
	int j = 0;
	int b = a;
	while (j < SZ(s))
	{
		//cerr << j << ' ' << b << ' ' << SZ(skipped) << '\n';
		string s2 = to_string(b);
		if (j + SZ(s2) > SZ(s))
			return {};
		int x = stoi(s.substr(j, SZ(s2)));
		b++;
		if (x != b - 1)
		{
			if (skipped.empty())
				skipped.PB(b - 1);
			else
				return {};
			continue;
		}
		j += SZ(s2);
		if (j == SZ(s))
			break;
	}
	if (skipped.empty())
	{
		if (a != 1)
			skipped.PB(a - 1);
		if (b - 1 != 99999)
			skipped.PB(b);
	}
	return skipped;
}

void solve()
{
	string s;
	cin >> s;
	VI ans;
	FOR (i, 0, min(5, SZ(s)))
	{
		int a = stoi(s.substr(0, i + 1));
		VI res = check(s, a);
		ans.insert(ans.end(), ALL(res));
	}
	sort(ALL(ans));
	ans.resize(unique(ALL(ans)) - ans.begin());
	cout << SZ(ans) << '\n';
	FOR (i, 0, SZ(ans))
	{
		if (i)
			cout << ' ';
		cout << ans[i];
	}
	cout << '\n';
}

int main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int t;
	cin >> t;
	while (t--)
		solve();
	
	return 0;
}