#include <bits/stdc++.h>
#define Dim 2000010
#define Lim 1000
FILE *fin  = freopen("strmatch.in", "r", stdin);
FILE *fout = freopen("strmatch.out", "w", stdout);

using namespace std;
char pattern[Dim], text[Dim];
int F[Dim], n, m, sol[Lim + 2];
void internal_rules()
{
    int i, j;
    F[1] = 0;
    for(i = 2, j = 0; i <= m; ++ i)
    {
        for( ; pattern[i - 1] != pattern[j] && j; j = F[j]);
        if(pattern[i - 1] == pattern[j])
            ++ j;
        F[i] = j;
    }
}
void KMP()
{
    int i, j;
    internal_rules();
    for(i = j = 0; j < n; )
    {
        /// if the current character of the text
        /// expands the current match
        if(text[j] == pattern[i])
        {
            ++ i; /// change current state of automaton
            ++ j; /// next character
            if(i == m && sol[0] < Lim)
                sol[++ sol[0]] = j - m;
            if(sol[0] == Lim) return;
        }
        else if(i > 0) i = F[i];
                else ++ j;
    }
}
void write()
{
    printf("%d\n", sol[0]);
    for(int i = 1; i <= sol[0]; ++ i)
        printf("%d ", sol[i]);
}
int main()
{
    gets(pattern);
    m = strlen(pattern);
    gets(text);
    n = strlen(text);
    KMP();
    write();
    return 0;
}