#include <stdio.h>
#include <fstream>
#include <string>
using namespace std;

char a[2000001], b[2000001], rez[2000001];

long num, nr, p1 = 97, win1 = 15921, p2 = 17, win2 = 21443, alen, blen, rez_size, def_power1, power1, power2, def_power2;

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

	f>>a;
	f>>b;

	alen = strlen(a);
	blen = strlen(b);

	if (alen > blen)
	{
		printf("0\n");
		return 0;
	}

	power1 = 1;
	int a_hash1 = 0, b_hash1 = 0, a_hash2 = 0, b_hash2 = 0;
	for (long i = alen - 1; i > 0; --i)
	{
		a_hash1 = (a_hash1 + a[i] * power1) % win1;
		b_hash1 = (b_hash1 + b[i] * power1) % win1;
		power1 = (power1 * p1) % win1;
	}
	a_hash1 = (a_hash1 + a[0] * power1) % win1;
	b_hash1 = (b_hash1 + b[0] * power1) % win1;
	def_power1 = power1;

	power2 = 1;
	for (long i = alen - 1; i > 0; --i)
	{
		a_hash2 = (a_hash2 + a[i] * power2) % win2;
		b_hash2 = (b_hash2 + b[i] * power2) % win2;
		power2 = (power2 * p2) % win2;
	}
	a_hash2 = (a_hash2 + a[0] * power2) % win2;
	b_hash2 = (b_hash2 + b[0] * power2) % win2;
	def_power2 = power2;

	for (long i = alen; i < blen; ++i)
	{
		if (a_hash1 == b_hash1 && a_hash2 == b_hash2)
		{
			rez[i - alen] = 1, ++num;
		}

		b_hash1 = ((b_hash1 - (def_power1 * b[i - alen]) % win1 + win1) * p1 + b[i]) % win1;
		b_hash2 = ((b_hash2 - (def_power2 * b[i - alen]) % win2 + win2) * p2 + b[i]) % win2;
	}

	if (a_hash1 == b_hash1 && a_hash2 == b_hash2)
	{
		rez[blen - alen] = 1, ++num;
	}

	g<<num<<endl;
	for (long i = 0; i < blen && nr < 1000; ++i)
		if (rez[i])
			g<<i<<" ", ++nr;
	g<<endl;
	return 0;
}