#include<fstream>
#include<cstring>
#define max_dim 2000000
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char M[max_dim],N[max_dim];
int n,m,q,k,pi[max_dim],nr,sol[1005];
void calcul_prefix()
{
	pi[1]=0;
	for(int i=2;i<=n;i++)
	{
		while(k>0 && N[k+1]!=N[i])
			k=pi[k];
		if(N[k+1]==N[i])
			k++;
		pi[i]=k;
	}
}
void potrivire_KMP()
{
	for(int i=1;i<=m;i++)
	{
		while(q && N[q+1]!=M[i]) 
			q=pi[q]; 
		if(N[q+1]==M[i]) 
			q++; 
		if(q==n) 
		{
			q=pi[n];
			nr++;
			if(nr<=1000)
				sol[nr]=i-n+1;
		}
	}
}
int main()
{
	f>>N>>M;
	for (; (N[n] >= 'A' && N[m] <= 'Z') || (N[m] >= 'a' && N[m] <= 'z') || (N[m] >= '0' && N[m] <= '9'); ++n);
	for (; (M[m] >= 'A' && M[m] <= 'Z') || (M[m] >= 'a' && M[m] <= 'z') || (M[m] >= '0' && M[m] <= '9'); ++m); 
	for (int i = n; i; --i) M[i] = M[i-1]; M[0] = ' ';     
	for (int i = m; i; --i) N[i] = N[i-1]; N[0] = ' ';
	calcul_prefix();
	potrivire_KMP();
	g<<nr<<'\n';
	for(int i=1;i<=nr;i++)
		g<<sol[i]<<" ";
	g<<'\n';
	return 0;
}