#include <iostream>
#include <fstream>
#include <string>
#include <algorithm>
#define NMAX 2000005

using namespace std;

ifstream in("strmatch.in");
ofstream out("strmatch.out");
string a,b;

int sol[NMAX];
int n = 0;

int main()
{
    in >> b >> a;
    int found;
    found = a.find(b);
    while(found >= 0)
    {
        sol[++n] = found;
        found = a.find(b,found+1);
    }
    out << n << endl;
    for(int i = 1 ; i <= min(n,1000) ; i++)
        out << sol[i] << " ";
    return 0;
}