#include <bits/stdc++.h>
#define minim(a, b) ((a < b) ? a : b)
#define NMax 2000005
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int M, N, q ,n;
string substring, str, prefix, pos;

void make_prefix(void)
{
    prefix[0] = 0;

    for (int i = 2, q = 0; i <= M; ++i){
        while (q && substring[q+1] != substring[i])
            q = prefix[q];
        if (substring[q+1] == substring[i])
            ++q;
        prefix[i] = q;
    }
}

int main()
{
    in >> substring >> str;

    M = substring.length();
    N = str.length();
    str.insert(0," ");
    substring.insert(0," ");

    make_prefix();

    for (int i = 1; i <= N; ++i)
    {
        while (q && substring[q+1] != str[i])
            q = prefix[q];
        if (substring[q+1] == str[i])
            ++q;
        if (q == M)
        {
            q = prefix[M];
            ++n;
            pos[n] = i-M;
        }
    }

    out<< n <<endl;;
    for (int i = 1; i <= minim(n, 1000); ++i)
        out<< pos[i] <<" ";
    out<<endl;

    return 0;
}