#include <iostream>
#include <fstream>
#define NMax 2000045

using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");

char A[NMax],B[NMax];
int pos[1024],pi[NMax];
int N,M;
void make_prefix()
{
    int q=0;
    for(int 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()
{
    int q=0,n=0,i;
    f.getline(A,NMax);
    f.getline(B,NMax);
    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(i=M;i>=1;--i)A[i]=A[i-1];A[0]=' ';
    for(i=N;i>=1;--i)B[i]=B[i-1];B[0]=' ';
    make_prefix();
    for(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)
        {
            n++;
            if(n<=1000)
            {
                pos[n]=i-M;
            }
        }
    }
    g<<n<<"\n";
    for(i=1;i<=min(n,1000);++i)
        g<<pos[i]<<' ';
    return 0;
}