#include <cstdio>
#include <cstdlib>
#include <cstring>

#define FOR(AA,BB,CC) for(int AA=(BB); AA<(CC); ++AA)
#define NMAX 2000010

char A[NMAX], N, B[NMAX], M;
int P[NMAX];
int num_matches, matches[1000];

void build_prefix() {
	int k = -1;
	P[0] = -1;
	
	FOR(q, 1, M) {
		while (k>=0 && A[k+1] != A[q])
			k = P[k];
		if (A[k+1] == A[q])
			++k;
		P[q] = k;
	}
}

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

	for (; (A[M] >= 'A' && A[M] <= 'Z') || (A[M] >= 'a' && A[M] <= 'z') ||
		(A[M] >= '0' && A[M] <= '9'); ++M);

	for (; (B[N] >= 'A' && B[N] <= 'Z') || (B[N] >= 'a' && B[N] <= 'z') ||
		(B[N] >= '0' && B[N] <= '9'); ++N);

	build_prefix();

	
	int k = -1;
	FOR(i, 0, N) {
		while (k>=0 && A[k+1] != B[i])
			k = P[k];
		if (A[k+1] == B[i])
			++k;
		if (k == M-1) {
			if (num_matches < 1000)
				matches[num_matches++] = i - M + 1;
			k = P[k];
		}
	}

	printf("%d\n", num_matches);
	FOR(i, 0, num_matches > 1000 ? 1000 : num_matches) {
		printf("%d ", matches[i]);
	}
	puts("");

	fclose(stdout);
}