#include <fstream>
#define Nmax 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
char a[Nmax],b[Nmax];
int M,N;
int pi[Nmax],pos[1024];
void make_prefix()
{
    int i,q=0;
    pi[1]=0;
    for (i=2; i<=M; i++)
    {
        while (q && a[q+1]!=a[i])
            q=pi[q];
        if (a[q+1]==a[i])
            q++;
        pi[i]=q;
    }

}
int main()
{
    fin>>a>>b;
    for (; (a[M]>='A' && a[M]<='Z') || (a[M]>='a' && a[M]<='z') || (a[M]>='0' && a[M]<='9'); M++);
    for (; (b[N]>='A' && b[N]<='Z') || (b[N]>='a' && b[N]<='z') || (b[N]>='0' && b[N]<='9'); N++);

    for (int i=M; i; i--)
        a[i]=a[i-1];
    a[0]=' ';
    for (int i=N; i; --i)
        b[i]=b[i-1];
    b[0]=' ';
    int q=0,n=0;
    make_prefix();




    for (int i=1; i<=N; i++)
    {
        while (q && a[q+1]!=b[i])
            q=pi[q];
        if (a[q+1]==b[i])
            ++q;
        if (q==M)
        {
            q=pi[M];
            ++n;
            if (n<=1000)
                pos[n]=i-M;
        }

    }
    fout<<n<<'\n';
    for (int i=1; i<=min(n,1000); i++)
        fout<<pos[i]<<' ';
    return 0;
}