/*Potrivirea sirurilor - KMP*/

#include <stdio.h>
#include <string.h>
#define NMAX 2000005

char sir1[NMAX], sir2[NMAX];
int i, j, k, n, m, rez[1005], pre[NMAX];

void prefix(char *sir)
{
	int l = strlen(sir);
    int i = 0, j = 0;

    for(i = 2; i<l; ++i)
	{
		while(j && sir[j+1] != sir[i])
			j = pre[j];
		if(sir[j+1] == sir[i])
			++j;
		pre[i] = j;
	}
}

int main()
{
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);

	scanf("%s", sir1);
	scanf("%s", sir2);

	n = strlen(sir1);
	m = strlen(sir2);

	if(n > m)
	{
	    printf("0\n");
	    return 0;
	}

	memcpy(sir1 + 1, sir1, n*sizeof(char));
	memcpy(sir2 + 1, sir2, m*sizeof(char));

	prefix(sir1);

	j = 0;
	for(i = 1; i <= m; ++i)
	{
		while(j && sir1[j+1] != sir2[i])
			j = pre[j];
		if(sir1[j+1] == sir2[i])
			++j;
		if(j == n)
		{
			j = pre[j];
			if(k + 1 > 1000)
                break;
			else
				rez[++k] = i - n;
		}
	}

	printf("%d\n", k);
	for(i = 1; i <= k; ++i)
		printf("%d ", rez[i]);
    printf("\n");

	return 0;
}