#include<cstdio>
#include<algorithm>
#include<cstring>

using namespace std;

char a[2000002],b[2000002];
int p[2000002],d[2000002],sol[1002],nr,i,n,m;

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

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

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    gets(a+1);
    gets(b+1);
    n=strlen(a+1);
    m=strlen(b+1);
    precalc();
    solve();
    printf("%d\n",nr);
    for(i=1;i<=min(1000,nr);i++)
    {
        printf("%d ",sol[i]);
    }
    return 0;
}