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

#define sz(x) (int)(x).size()
#define all(x) (x).begin(), (x).end()
#define rall(x) (x).rbegin(), (x).rend()
#define pb push_back
#define x first
#define y second
#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--)

typedef long long ll;
typedef double db;
typedef long double LD;
typedef pair<int, int> pii;
typedef pair<db, db> pdd;
typedef pair<ll, ll> pll;


int solve()
{
	string s;
	if (!(cin >> s))
		return 1;
	
	int n = sz(s);
	set<int> ans;
	FOR (c, 1, min(6, n + 1))
	{
		string str = s.substr(0, c);
		int st = stoi(str);
		int j = 0;
		int num = st - 1;
		vector<int> nums;
		bool ok = 1;
		while (j < n)
		{
			num++;
			string snum = to_string(num);
			int m = sz(snum);
			if (j + m > n)
			{
				ok = 0;
				break;
			}
			string act = s.substr(j, m);
			int anum = stoi(act);
			if (anum != num)
			{
				if (nums.empty())
					nums.pb(num);
				else
				{
					ok = 0;
					break;
				}
			}
			else
			{
				j += m;
			}
		}
		if (!ok)
			continue;
		if (nums.empty())
		{
			ans.insert(st - 1);
			ans.insert(num + 1);
		}
		else
			ans.insert(nums[0]);
	}
	ans.erase(-1);
	ans.erase(0);
	ans.erase(100000);
	cout << sz(ans) << '\n';
	for (int el: ans)
		cout << el << ' ';
	cout << '\n';
	
	return 0;
}

int32_t main()
{
	ios::sync_with_stdio(0);
	cin.tie(0);
	
	int TET = 1e9;
	cin >> TET;
	for (int i = 1; i <= TET; i++)
	{
		if (solve())
		{
			break;
		}
		#ifdef ONPC
			cerr << "_____________________________\n";
		#endif
	}
	#ifdef ONPC
		cerr << "\nfinished in " << clock() * 1.0 / CLOCKS_PER_SEC << " sec\n";
	#endif
	return 0;
}