#include <cstdio>
#include <string>
char a[2000001],b[2000001];
int t[2000001];
int s[1001];
int n,m;

inline int min(int a, int b)
{
    if(a<b) return a;
    return b;
}

void solve()
{
    t[1]=0;
    int k=0,i;

    for(i=2;i<=n;++i)
    {
	while(k>0 && a[k+1]!=a[i]) k=t[k];
	if(a[k+1]==a[i])++k;
	t[i]=k;
    }


    k=0;
    int nr=0;
    for(i=1;i<=m;++i)
    {
	while(k>0 && a[k+1]!=b[i])k=t[k];
	if(a[k+1]==b[i]) ++k;

	if(k==n)
	{
	    if(nr<1000)
		s[++nr]=i-k;
	    else ++nr;
	}

    }

    freopen("strmatch.out","w",stdout);
    printf("%d\n",nr);
    for(i=1;i<=min(nr, 1000);++i)printf("%d ", s[i]);
}

int main()
{
    freopen("strmatch.in","r",stdin);
    gets(a);
    gets(b);
    n=strlen(a);
    m=strlen(b);
    int i;
    for(i=n;i>=1;--i) a[i]=a[i-1];
    for(i=m;i>=1;--i) b[i]=b[i-1];

    solve();
    return 0;
}