#include<fstream>
#include<algorithm>
#include<string.h>
#include<string>
#include<math.h>
#include<iostream>
#include<queue>
#include<bitset>
#include<set>
#include<map>
using namespace std;

ifstream in("strmatch.in");
ofstream out("strmatch.out");

int finite_automata[2000010];

vector<int> indices;

void make_prefix(string pattern)
{
	int state_j = 0;
	for (int i = 1; i < pattern.length(); ++i)
	{
		while (state_j > 0 && pattern[state_j] != pattern[i])
		{
			state_j = finite_automata[state_j - 1];
		}

		if (pattern[state_j] == pattern[i])
		{
			state_j++;
		}

		finite_automata[i] = state_j;
	}

}

void search(string str, string pattern)
{

	int state_j = 0;

	for (int i = 0; i < str.length(); ++i)
	{
		while (state_j > 0 && pattern[state_j] != str[i])
		{
			state_j = finite_automata[state_j - 1];
		}

		if (pattern[state_j] == str[i])
		{
			state_j++;
		}

		if (state_j == pattern.length())
		{
			state_j = finite_automata[state_j - 1];

			if(indices.size() < 1000)
				indices.push_back(i - pattern.length() + 1);
		}
	}

}

string s1, s2;

int main()
{

	in >> s2 >> s1;


	make_prefix(s2);

	search(s1, s2);


	out << indices.size() << "\n";

	for (auto& i : indices)
	{
		out << i << " ";
	}



	return 0;
}