#include<stdio.h>
#include<string.h>
#include<algorithm>
using namespace std;
char A[2000010],B[2000010];
int q, pi[2000010],rez[1010],k;
 
int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    scanf("%s%s",A,B);
    int M = strlen(A);
    int N = strlen(B);
 
    for(int i=M;i>=1;--i)
        A[i]=A[i-1];
    A[0] = ' ';
 
    for(int i=N;i>=1;--i)
        B[i]=B[i-1];
    B[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;
    }
 
    q=0;
 
    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];
            ++k;
            if(k<=1000)
                rez[k] = i-M;
        }
 
    }
 
    printf("%d\n",k);
    for(int i=1;i<=min(k,1000);++i)
        printf("%d ",rez[i]);
 
    return 0;
}