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

#define MAXN 2000001
#define P 73
#define MOD1 100007
#define MOD2 100021
#define min(x, y) (((x) < (y)) ? (x) : (y))

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

int hashA1, hashA2, P1 = 1, P2 = 1;
bool match[MAXN];

int main()
{
	freopen("strmatch.in", "rt", stdin);
	freopen("strmatch.out", "wt", stdout);

	scanf("%s\n %s", &A, &B);
	NA = strlen(A), NB = strlen(B);

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

	for (int i = 0; i < NA; ++i){
		hashA1 = (hashA1 * P + A[i]) % MOD1;
		hashA2 = (hashA2 * P + A[i]) % MOD2;
		if (i)
			P1 = (P1 * P) % MOD1,
			P2 = (P2 * P) % MOD2;
	}

	int hash1 = 0, hash2 = 0;
	for (int i = 0; i < NA; ++i)
		hash1 = (hash1 * P + B[i]) % MOD1,
		hash2 = (hash2 * P + B[i]) % MOD2;

	if (hashA1 == hash1 && hashA2 == hash2) ++ans, match[0] = 1;

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

		if (hash1 == hashA1 && hash2 == hashA2) match[i - NA + 1] = 1, ++ans;
	}
	printf("%d\n", ans);

	for (int i = 0, j = 1; j <= min(ans, 1000); ++i)
		if (match[i]) printf("%d ", i), ++j;

	return 0;
}