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

using namespace std;

char sir1[2000010],sir2[2000010];
int rez[1010],d[2000010];

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    gets(sir1+1);
    gets(sir2+1);
    int l1=strlen(sir1+1),l2=strlen(sir2+1);
    int k=0;
    for(int i=2;i<=l1;i++)
    {
        while(k>0 && sir1[i]!=sir1[k+1]) k=d[k];
        if(sir1[i]==sir1[k+1]) k++;
        d[i]=k;
    }
    k=0;
    int sol=0;
    for(int i=2;i<=l2;i++)
    {
        while(k>0 && sir2[i]!=sir1[k+1]) k=d[k];
        if(sir2[i]==sir1[k+1]) k++;
        if(k==l1)
        {
            sol++;
            if(sol<=1000) rez[sol]=i-k;
        }
    }
    printf("%d\n",sol);
    int a=min(sol,1000);
    for(int i=1;i<=a;i++)
        printf("%d ",rez[i]);
    return 0;
}