#include <cstdio>
#include <string.h>

#define Nmax 2000010
#define P 101
#define MOD1 100021
#define MOD2 100013

char a[Nmax], b[Nmax];
int A, B, HA1, HA2, HB1, HB2, P1, P2, N, i;
int sol[1024];

int main () {

	freopen ("strmatch.in", "r", stdin);
	freopen ("strmatch.out", "w", stdout);
	
	a[0] = b[0] = ' ';
	scanf ("%s", b + 1); scanf ("%s", a + 1);
	A = strlen (a) - 1; B = strlen (b) - 1;

	P1 = P2 = 1;
	for (i = 1; i <= B; i++) {
		HB1 = (HB1 * P + b[i]) % MOD1, HB2 = (HB2 * P + b[i]) % MOD2;
		if (i != B) 
			P1 = (P1 * P) % MOD1, P2 = (P2 * P) % MOD2;
	}
	
	for (i = 1; i <= B; i++) 
		HA1 = (HA1 * P + a[i]) % MOD1, HA2 = (HA2 * P + a[i]) % MOD2;
	
	if (HA1 == HB1 && HA2 == HB2) sol[++N] = 1;
	for (i = B + 1; i <= A; i++) {
		HA1 = (( HA1 - (a[i - B] * P1) % MOD1 + MOD1 ) * P + a[i]) % MOD1;
		HA2 = (( HA2 - (a[i - B] * P2) % MOD2 + MOD2 ) * P + a[i]) % MOD2;
		
		if (HA1 == HB1 && HA2 == HB2){
			N++;
			if (N <= 1000) sol[N] = i - B + 1;
		}
	}
	
	printf ("%d\n", N);
	if (N > 1000) N = 1000;
	for (i = 1; i <= N; i++) 
		printf ("%d ", sol[i] - 1);
	
	return 0;
}