#include <cstdio>
#include <cstring>
#include <vector>

using namespace std;

#define NMAX 2000007

vector < int > sol,one,two;
int lA,lB,i,j;
bool good[NMAX];
int inv[NMAX],H[NMAX];
char A[NMAX],B[NMAX];

void match(int base,int MOD,vector < int > &sol)
{
    memset(H,0,sizeof(H));
    memset(inv,0,sizeof(inv));
    int now=0,value=0,a,i;

    for (i=a=1;i<=lA;++i)
    {
        value=(value+a*A[i])%MOD;
        a=(a*base)%MOD;
    }

    for (i=inv[1]=1;i<=MOD-2;++i)
    inv[1]=(inv[1]*base)%MOD;

    for (i=a=inv[0]=1;i<=lB;++i)
    {
        H[i]=(H[i-1]+a*B[i])%MOD;
        a=(a*base)%MOD;
        inv[i]=(1LL*inv[i-1]*inv[1])%MOD;
    }

    for (i=lA;i<=lB;++i)
    {
        now=(1LL*((H[i]-H[i-lA]+MOD)%MOD)*inv[i-lA])%MOD;
        if (now==value) sol.push_back(i-lA);
    }
}

int main()
{
freopen("strmatch.in","r",stdin);
freopen("strmatch.out","w",stdout);

scanf("%s%s",(A+1),(B+1));
lA=strlen(A+1),lB=strlen(B+1);

match(137,666013,one);
match(151,10037,two);

i=j=0;
while (i<one.size() && j<two.size())
{
    if (one[i]==two[j])
    {
        sol.push_back(one[i]);
        ++i,++j;
        continue;
    }

    (one[i]<two[j]) ? ++i : ++j;
}

for (i=0,printf("%d\n",sol.size());i<sol.size() && i<1000;++i)
printf("%d ",sol[i]);

return 0;
}