#include <fstream>
using namespace std;

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

char a[20000001], b[20000001];
long long p[20000001], k = 0, pos[1001];


void pref()
{
	int l = 0;
	for (int i = 1; b[i]; i++)
	{
		while (l && b[i] != b[l])
			l = p[l - 1];
		if (b[i] == b[l])
			l++;
		p[i] = l;
	}
}

void kmp()
{
	for (int i = 0, j = 0; a[i]; i++)
	{
		while (j && a[i] != b[j])
			j = p[j - 1];
		if (a[i] == b[j])
			j++;
		if (!b[j])
			pos[k++] = i - j + 1;
	}
}

int main()
{
	f.getline(b, 20000001);
	f.getline(a, 20000001);
	pref();
	kmp();
	g << k << "\n";
	k = (k < 1000 ? k : 1000);
	for (int i = 0; i < k; i++)
		g << pos[i] << " ";
	return 0;
}