#include <fstream>
#include <vector>
using namespace std;

string N, M;
int n, m;
vector<int> * pi;

void calculate_prefix()
{
    pi->at(1) = 0;
    int k = 0;
    for(int i=2; i<=n; ++i)
    {
        while(k > 0 && N[k+1] != N[i])
            k = pi->at(k);
        if(N[k+1] == N[i])
            ++k;
        pi->at(i) = k;
    }
}

void find_matches(ofstream &out)
{
    vector<int> matches(1000);
    int k = 0;
    int nr = 0;
    for(int i=1; i<=m && nr<1000; ++i)
    {
        while(k > 0 && N[k+1] != M[i])
            k = pi->at(k); 
        if(N[k+1] == M[i])
            ++k;
        if(k == n)
        {
            matches[nr++] = i - n;
            k = pi->at(n);
        }
    }
    out << nr << endl;
    for(int i=0; i < nr-1; ++i)
        out << matches[i] << " ";
    out << matches[nr-1];
}

int main()
{
    ifstream in("strmatch.in");
    getline(in, N);
    getline(in, M);
    in.close();
    ofstream out("strmatch.out");
    n = N.length(); m = M.length();
    N.resize(n+2); M.resize(m+2);
    for(int i=n; i;--i) N[i] = N[i-1];
    N[0] = N[n+1] = ' ';
    for(int i=m; i;--i) M[i] = M[i-1];
    M[0] = M[m+1] = ' ';
    pi = new vector<int>(n+1);
    calculate_prefix();
    find_matches(out);
    delete pi;
    out.close();
    return 0;
}