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

#define Lmax 2000005

using namespace std;
char A[Lmax],B[Lmax];
int P[Lmax],N,M,nre;
vector<int> v;

void make_prefix()
{
    int q = 0,i;
    for(i = 2; i <= N; ++i)
    {
        while(q && A[i] != A[q+1])
            q = P[q];
        if(A[i] == A[q+1])
            ++q;
        P[i] = q;
    }
}

void make_pattern()
{
    int q = 0,i;
    for(i = 1; i <= M; ++i)
    {
        while(q && B[i] != A[q+1])
            q = P[q];
        if(B[i] == A[q+1])
            ++q;
        if(q == N)
        {
            q = P[q];
            if(++nre <= 1000)
                v.push_back(i-N);
        }
    }
}

void KMP()
{
    make_prefix();
    make_pattern();
}

void print()
{
    printf("%d\n",nre);
    for(int i = 0; i < (int)v.size(); ++i)
        printf("%d ",v[i]);
}

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

    scanf("%s%s",A+1,B+1);
    A[0]='*';B[0]='*';
    N = strlen(A) - 1; M = strlen(B) - 1;

    KMP();
    print();

    return 0;
}