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

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



int main()
{
	string A, B;
	f >> A >> B;
	int n = A.size();
	int m = B.size();
	vector<int> pi(n, 0);
	int k = 0;
	for (int i = 1;i < n;i++)
	{
		while (k > 0 && A[i] != A[k])
			k = pi[k - 1];
		if (A[i] == A[k])
			k++;
		pi[i] = k;
	}

	vector<int> pozitii;
	int count = 0;
	k = 0;
	for (int i = 0;i < m;i++)
	{
		while (k > 0 && B[i] != A[k])
			k = pi[k - 1];
		if (B[i] == A[k])
			k++;
		if (k == n)
		{
			count++;
			if (pozitii.size() < 1000)
				pozitii.push_back(i - n + 1);
			k = pi[k - 1];
		}
	}
	g << count << "\n";
	for (int p : pozitii)
		g << p << "";
	g << "\n";
}