# include <stdio.h>
# include <string.h>
# define nmax 2000001
char A[nmax],B[nmax];
int Prefix[nmax], p[1024];
long n,m;

void prefix(void)
{
  int i, k=-1;
  Prefix[0]=-1;
  for (i=1;i<n;i++)
    {
	while (k>-1 && A[k+1]!=A[i])
	    k=Prefix[k];
	if (A[k+1]==A[i]) k++;
	Prefix[i]=k;
    }
}
int main(){
  long i,k;
  int j=0;

  freopen("strmatch.in", "r", stdin);
  freopen("strmatch.out", "w", stdout);
  fgets(A, sizeof(A), stdin);
  fgets(B, sizeof(B), stdin);
  for (; (A[n] >= 'A' && A[n] <= 'Z') || (A[n] >= 'a' && A[n] <= 'z')
	    || (A[n] >= '0' && A[n] <= '9'); ++n);
  for (; (B[m] >= 'A' && B[m] <= 'Z') || (B[m] >= 'a' && B[m] <= 'z')
	    || (B[m] >= '0' && B[m] <= '9'); ++m);
  prefix();
  k=-1;
  for (i=0;i<m;i++){
	while (k>-1 && A[k+1]!=B[i]) k=Prefix[k];
	if (A[k+1]==B[i]) k++;
	if (k==n-1){
	     k=Prefix[n-1],j++;
	     if (j<=100) p[j]=i-n+1;
 	 }       
   }
  printf("%d\n",j);
  if (j>1000) j=1000;
  for (i=1;i<=j;i++)
     printf("%d ", p[i]);
  return 0;
}