#include <cstdio>
#include <string.h>
using namespace std;
int i,m,n,d,nr,min,k,p[2000000],sol[2000000];
char a[2000000],b[2000000];
void urm(void)
{
    p[0]=0;
    k=-1;
    for (i=1;i<=m-1;i++)
        {
          while ((k>-1)&&(a[k+1]!=a[i]))k=p[k];
          if (a[k+1]==a[i])k++;
          p[i]=k;
        };
};

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