#include <fstream>
#include <string>
#include <queue>

using namespace std;

string A, B;
deque <int> q;

int main () {
    ifstream fin ("strmatch.in");
    fin >> A >> B;
    fin.close ();
    int cnt = 0;
    int poz = -1;
    ofstream fout ("strmatch.out");
    while (1)
    {
        poz = B.find (A, poz + 1);
        q.push_back (poz);
        if (poz == (int) string::npos) break;
        cnt++;
    }
    fout << cnt << "\n";
    q.pop_back ();
    while (!q.empty ())
    {
        fout << q.front () << " ";
        q.pop_front ();
    }
    fout.close ();
    return 0;
}