#include <stdio.h>
#include <string.h>

#define MAXN 2000001

#define P 73
#define MOD1 100007
#define MOD2 100021

char A[MAXN], B[MAXN];
int NA, NB;

int h1m1, h1m2, P1, P2, h2m1, h2m2;

char match[MAXN];

int main()
{
	freopen("strmatch.in", "rt", stdin);
	freopen("strmatch.out", "wt", stdout);
	
	scanf("%s %s", A, B);
	NA = strlen(A);
	NB = strlen(B);

	P1 = P2 = 1;
	for (int i = 0; i < NA; i++){
		h1m1 = (h1m1 * P + A[i]) % MOD1; h1m2 = (h1m2 * P + A[i]) % MOD2;
		h2m1 = (h2m1 * P + B[i]) % MOD1; h2m2 = (h2m2 * P + B[i]) % MOD2;

		if (i != 0)
			P1 = (P1 * P) % MOD1,P2 = (P2 * P) % MOD2;
	}

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

	int Nr = 0;
	if (h2m1 == h1m1 && h2m2 == h1m2)
		match[0] = 1, Nr++;

	for (int i = NA; i < NB; i++){
		h2m1 = ((h2m1 - (B[i - NA] * P1) % MOD1 + MOD1) * P + B[i]) % MOD1;
		h2m2 = ((h2m2 - (B[i - NA] * P2) % MOD2 + MOD2) * P + B[i]) % MOD2;

		if (h2m1 == h1m1 && h2m2 == h1m2)
			match[Nr] =  i - NA + 1 , Nr++;
	}
	
	printf("%d\n", Nr);
	for (int i = 0; i < Nr; i++) printf("%d ", match[i]);
	printf("\n");
	
	return 0;
}