#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <string>
#include <algorithm>
#include <vector>
#include <queue>
#include <deque>
#include <set>
#include <stack>
#include <cassert>
using namespace std;

#define PRO "strmatch"
void OpenFiles(int EVAL)
{
	if(EVAL)
	{
		char input[100] = PRO, output[100] = PRO;
		freopen(strcat(input, ".in"),"r",stdin);
		freopen(strcat(output,".out"),"w",stdout);
	} else
	{
		freopen("test.in","r",stdin);
		freopen("test.out","w",stdout);
	}
}

#define MAX 2000001
#define INF 0xffffff

int n,u[MAX],c[1001],nr;
char a[MAX],b[MAX];

void Prefix()
{
	int k=-1;
	u[0] = -1;
	for(int i=1;a[i]!='\0' && a[i]!='\n';n=++i)
	{
		while(k>-1 && a[k+1]!=a[i])k=u[k];
		if(a[k+1]==a[i])k++;
		u[i]=k;
	}
}

void KMP()
{
	int k=-1;
	for(int i=0;b[i]!='\0' && b[i]!='\n';++i)
	{
		while(k>-1 && a[k+1]!=b[i])k=u[k];
		if(a[k+1]==b[i])k++;
		if(k+1==n)
		{
			nr++;
			if(nr<=1000)c[nr]=i-n+1;
			k=u[k];
		}
	}
}

int main(int argv,char *args[])
{
	OpenFiles(argv==0);
	// start
		scanf("%s ",a);
		scanf("%s ",b);
		Prefix();
			//for(int i=0;i<n;i++)printf("%d ",u[i]);
		KMP();
		printf("%d\n",nr);
		for(int i=1;i<=nr;i++)printf("%d ",c[i]);
		return 0;
}