#include<iostream>
#include<fstream>
#include<unordered_map>
#include<string>
#include<vector>
std::ifstream in("strmatch.in");
std::ofstream out("strmatch.out");
using namespace std;
int kmp[2000001];
string s, c;
vector<int>v;
void calc() {
	kmp[1] = 0;
	for (int i = 2; i <= s.size(); i++) {
		int l = kmp[i - 1];
		while (s[l] != s[i - 1] && l > 0) l = kmp[l];
		if (s[l] == s[i - 1]) kmp[i] = l + 1;
		else kmp[i] = 0;
	}
}
int main() {
	in >> c >> s;
	s = c + '$' + s;
	calc();
	for (int i = c.size() + 1; i <= s.size(); i++)
		if (kmp[i] == c.size()) v.push_back(i - 2 * c.size() - 1);
	out << v.size() << '\n';
	for (auto i : v) out << i << " ";
	return 0;
}