#include<fstream>
#include<iostream>
#define MAX 2000001
using namespace std;

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

int m, n, k, c, pi[MAX];
char N[MAX], M[MAX];	//N - pattern, M - big string
int a[MAX];
//ABA
//CABBCABABAB
//0001123
//k = 0
void prefixCalculation()
{
	pi[0] = 0;
	for (int i = 1; i < n; ++i)
	{
		k = pi[i - 1];
		while (k > 0 && N[k] != N[i])
			k = pi[k - 1];
		if (N[i] == N[k])
			k++;
		pi[i] = k;
	}
}

void KMP()
{
	int q = 0;
	for (int i = 0; i < m; ++i)
	{
		while (q > 0 && N[q + 1] != M[i])
			q = pi[q];
		if (N[q+1] == M[i])
			q = q + 1;
		if (q == n - 1)
		{
			a[c++] = i - n + 1;
		}
	}
}

void readData()
{
	f.getline(N, MAX);
	f.getline(M, MAX);
	n = strlen(N);
	m = strlen(M);
}

int main()
{
	readData();
	prefixCalculation();
	KMP();
	g << c << '\n';
	for (int i = 0; i < c; ++i)
	{
		g << a[i] << ' ';
	}
}