#include <fstream>
#include <iostream>
#include <string>
#include <vector>
using namespace std;

ifstream fin("strmatch.in");
ofstream fout ("strmatch.out");
int Nr;
vector<int> aparitii;

void longestProperPrefix (vector<int>& result, string pat){
	int i = 1;
	int len = 0;
	result.push_back(0);
	//din nou
	while (i < pat.size())
	{
		if (pat[len] == pat[i]){
			++len;
			result.push_back(len);
			++i;
		}
		else {
			if (len != 0) {
				len = result[len-1];
			}
			else {
				result.push_back(0);
				++i;
			}
		}
	}
	/*int q = 0;
	result.push_back(0);
	for (int i = 1; i < pat.size(); i++){
		while (pat[i] != pat[q+1] && q!=0)
			q = result[q];
		if (pat[i] == pat[q+1])
			++q;
		result.push_back(q);
	}*/
}
void KMP (vector<int>& result, string text, string pat){
	int i = 0, j = 0;
	while (i < text.size()) 
	{
		//cout<<text[i]<<" "<<j<<endl;
		if (text[i] == pat[j])
		{
			++j;
			++i;
		}
		if (j == pat.size())
		{
			aparitii.push_back(i-j);
			j = result[j-1];
			Nr++;
			//cout<<i;
		}
		else if (i < text.size() && pat[j] != text[i]) {
			if (j != 0)
				j = result[j-1];
			else 
				i++;
		}
	}
}
int main(){
	string patt;
	string text;
	//fin.open("strmatch.in");
	//fin.open("strmatch.out");
	fin >> patt;
	fin >> text;
	vector<int> result;
	longestProperPrefix (result, patt);
	//for (int i = 0; i<result.size();++i)
	//			cout<<result[i]<<" ";
	KMP (result, text, patt);
	fout<<Nr<<endl;
	if (Nr != 0){
		if (Nr > 1000)
			Nr = 1000;
		for (int i = 0; i<=Nr-1; i++){
			//int aux = aparitii.front();
			//aparitii.erase(aparitii.begin());

			fout<<aparitii[i]<<" ";
		}
	}
	return 0;
}