#include<cstdio>

#include<algorithm>

#include<cstring>

using namespace std;

const int maxn=,maxm=;

char A[maxn],B[maxm];

int p[maxm],n,m;

int main()

{

    scanf("%s%s",A+,B+);

    n=strlen(A+);m=strlen(B+);

    p[]=;

    int j=;

    for(int i=;i<=m;i++)

     {

         while(j>&&B[j+]!=B[i])j=p[j];

         if(B[j+]==B[i])j++;

         p[i]=j;

     }

    j=;

    for(int i=;i<=n;i++)

     {

         while(j>&&B[j+]!=A[i])j=p[j];

         if(B[j+]==A[i])j++;

         if(j==m)

          {

              printf("%d\n",i-j+);

              j=p[j];

         }

     }

    for(int i=;i<m;i++)printf("%d ",p[i]);

    printf("%d",p[m]);

    return ;

}