#include <cstdio>
#include <cstdlib>
#include <cstring>
#include <algorithm>
using namespace std;

const int NMAX = 2000010;

int N, M, Z[NMAX], Sol[1010], Cnt;
char A[NMAX], B[NMAX];

void Build_Z()
{
    int C = 1, R = 1;
    Z[1] = 0;
    for(int i = 2; i <= N; ++ i)
    {
        if(R >= i) Z[i] = min(Z[i - C + 1], R - i + 1);
        for(; i + Z[i] <= N && A[i + Z[i]] == A[Z[i] + 1]; Z[i] ++);

        if(i + Z[i] - 1 > R)
        {
            C = i;
            R = i + Z[i] - 1;
        }
    }
}

void Z_Algorithm()
{
    int C = 0, R = 0;
    for(int i = 1; i <= M; ++ i)
    {
        int LCP = 0;
        if(R >= i) LCP = min(Z[i - C + 1], R - i + 1);
        for(; i + LCP <= M && LCP < N && A[LCP + 1] == B[i + LCP]; ++ LCP);
        if(LCP == N)
        {
            Cnt ++;
            if(Cnt <= 1000) Sol[Cnt] = i - 1;
        }

        if(i + LCP - 1 > R)
        {
            C = i;
            R = i + LCP - 1;
        }
    }
}

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

    gets(A + 1); N = strlen(A + 1);
    gets(B + 1); M = strlen(B + 1);

    Build_Z();
    Z_Algorithm();

    printf("%i\n", Cnt);
    for(int i = 1; i <= min(Cnt, 1000); ++ i)
        printf("%i ", Sol[i]);
}