#include <stdio.h>

#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005

int M, N;
char A[NMax], B[NMax];
int pi[NMax], pos[1024];

void make_prefix(void)
{
    int i, q = 0;

    for (i = 2, pi[1] = 0; 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(void)
{
    int i, q = 0, n = 0;

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

    fgets(A, sizeof(A), stdin);
    fgets(B, sizeof(B), stdin);
    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; --i) A[i] = A[i-1]; A[0] = ' ';
    for (i = N; i; --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)
        {
            q = pi[M];
            ++n;
            if (n <= 1000)
                pos[n] = i-M;
        }
    }

    printf("%d\n", n);
    for (i = 1; i <= minim(n, 1000); ++i)
        printf("%d ", pos[i]);
    printf("\n");

    return 0;
}


















/*#include <iostream>
#include <fstream>
#include <cstring>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int lga,lgb,i,pi[2000003],q,poz[1003],lg=0;
char a[2000003],b[2000003];
float x=1024;
int main()
{
    f.getline(a,2000000);//lga=strlen(a);
    f.getline(b,2000000);//lgb=strlen(b);
    for (; (a[lga] >= 'A' && a[lga] <= 'Z') || (a[lga] >= 'a' && a[lga] <= 'z')
            || (a[lga] >= '0' && a[lga] <= '9'); ++lga);
    for (; (b[lgb] >= 'A' && b[lgb] <= 'Z') || (b[lgb] >= 'a' && b[lgb] <= 'z')
            || (b[lgb] >= '0' && b[lgb] <= '9'); ++lgb);
    for(i=lga;i>0;i--)a[i]=a[i-1];a[0]=' ';
    for(i=lgb;i>0;i--)b[i]=b[i-1];b[0]=' ';
    q=0;
    for (i = 2, pi[1] = 0; i <= lga; ++i)
    {
        while (q && a[q+1] != a[i])
            q = pi[q];
        if (a[q+1] == a[i])
            ++q;
        pi[i] = q;
    }
    //q=0;
    //memset(pi,0,2000000);
    for(i=1;i<=lgb;i++)
    {
        while(q && a[q+1]!=b[i])
            q=pi[q];
        if(a[q+1]==b[i])
            q++;
        if(q==lga)
        {
            q=pi[lga];
            lg++;
            if(lg<=1000)poz[lg]=i-lga;
        }
    }

    g<<lg<<'\n';
    for(i=1;i<=min(1000,lg);i++)
        g<<poz[i]<<" ";
}
*/