#include<algorithm>
#include<string.h>
using namespace std;
#define NMAX 2000005
char P[NMAX],T[NMAX];
int PI[NMAX];
int n,m;
int i,q,k;
int N,poz[NMAX];
int main()
{
	freopen("strmatch.in","r",stdin);
	freopen("strmatch.out","w",stdout);
	P[0]=T[0]='*';
	scanf("%s %s",P+1,T+1);
	m=strlen(P)-1;
	for(q=2;q<=m;q++)
	{
		while(k>0&&P[k+1]!=P[q])
			k=PI[k];
		if(P[k+1]==P[q])
			k=k+1;
		PI[q]=k;
	}
	n=strlen(T)-1;
	q=0;
	for(i=1;i<=n;i++)
	{
		while(q>0&&P[q+1]!=T[i])
			q=PI[q];
		if(P[q+1]==T[i])
			q=q+1;
		if(q==m)
		{
			poz[++N]=i-m;
			q=PI[q];
		}
	}
	printf("%d\n",N);
	for(i=1;i<=N&&i<=1000;i++)
		printf("%d ",poz[i]);
	return 0;
}