#include <cstdio>
#include <string.h>
using namespace std;

int i,m,n,d,nr,minim,k,p[2000000],sol[2000000];
char a[2000000],b[2000000];


void urm(void)
{
    p[1]=0;
    k=0;
    for (i=2;i<=m;i++)
        {
          while ((k>0)&&(a[k+1]!=a[i]))k=p[k];
          if (a[k+1]==a[i])k++;
          p[i]=k;
        };
};

void solve(void)
{
  k=0;nr=0;
  for (i=1;i<=n;i++)
  {
    while ((k>0)&&(a[k+1]!=b[i]))k=p[k];
    if (a[k+1]==b[i])k++;
    if (k==m){nr++;sol[nr]=i-m;k=p[k];};
  };
  printf("%d\n",nr);
  if (nr<1000)minim=nr;
         else minim=1000;
  for (i=1;i<=minim;i++)printf("%d ",sol[i]);
};

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    scanf("%s",&a);
    scanf("%s",&b);
    m=strlen(a);
    n=strlen(b);
    for (i=m;i>0;i--)a[i]=a[i-1];
    for (i=n;i>0;i--)b[i]=b[i-1];
    urm();
    solve();
    return 0;
}