#include <iostream>
#include <fstream>
#include <algorithm>
#include <queue>
#include <cstring>
#include <vector>
#include <map>
#include <cstdio>
#include <list>
//#include <bits/stdc++.h>
#define fastio std :: ios_base :: sync_with_stdio(NULL), cin.tie(NULL), cout.tie(NULL);
#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005
using namespace std;

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

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)
{
    //header ->
    {
        fastio
        ios_base::sync_with_stdio(false);
        cin.tie(NULL);
        freopen("strmatch.in", "r", stdin);
        freopen("strmatch.out", "w", stdout);
    }

    //input ->
    {
        int i;
        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] = ' ';
    }

    //start of the program ->
    {
        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;
            }
        }
    }

    //output ->
    {
        cout << n << '\n';
        for(i = 1; i <= minim(n, 1000); ++i)
            cout << pos[i] << ' ';
    }
    exit(0);
}