#include <iostream>
#include <map>
#include <vector>
#include <string>
#include <fstream>

using namespace std;

int main()
{
    ifstream fin;    fin.open("strmatch.in");
    ofstream fout; fout.open("strmatch.out");
    
    string A, B;
    map<char, int> mp;
    vector<int> v;
    fin >> A >> B;
    
    int count=0, i, j, la=A.length(), lb=B.length();
    for (i=0; i<la-1; i++) mp[A[i]]=la-i-1;
    
    for (i=0; i<lb-la;)
    {
        j=la-1;
        while (A[j]==B[i+j] && j>=0) j--;
        if (j<0)
        {
            v.push_back(i);
            count++;
            i+= (i+la<lb)? mp[i+la]+1 : 1;
        }
        else i+=max(mp[B[i+j]],1);
    }
    fout << count <<'\n';
    for (auto c:v) fout << c <<' ';
    
    fin.close();
    fout.close();
}