#include <queue>
#include <cstdio>
#include <iostream>
#include <cstdlib>
#include <cstring>
#define NMAX 2000001

int main(){
	char *A, *B;
	std::queue<int> sol;
	int i, k, q, n, m;
	int pi[NMAX];
	
	freopen("strmatch.in", "r", stdin);
	freopen("strmatch.out", "w", stdout);
	
	A = (char*)calloc(NMAX, 1);
	B = (char*)calloc(NMAX, 1);
	A[0] = B[0] = ' ';
	scanf("%s%s", A + 1, B + 1);
	n = strlen(A) - 1;
	m = strlen(B) - 1;
	
	k = 0;
	pi[0] = 0;
	for(i = 2; i <= n; i++){
		while(k && A[k + 1] != A[i])
			k = pi[k];
		if (A[k + 1] == A[i])
			++k;
		pi[i] = k;
	}
	
	q = 0;
	for(i = 1; i <= m; i++){
		while(q && A[q + 1] != B[i])
			q = pi[q];
		if (A[q + 1] == B[i])
			++q;
		if (q == n)
			sol.push(i - n);
	}
	
	printf("%d\n", sol.size());
	for(i = 0; i < 1000 && !sol.empty(); i++)
		printf("%d ", sol.front()),sol.pop();
	
	printf("\n"); 
	return 0;
}