#include <fstream>

using namespace std;

string minta,szoveg;
long l,k,m[1000];

int main()
{
  ifstream in("strmatch.in");
  ofstream out("strmatch.out");

  in >> minta;
  in >> szoveg;

  l=0;
  k=szoveg.find(minta,0);
  while (k!=string::npos)
  {
    ++l;
    if (l<=1000) m[l]=k;
    k=szoveg.find(minta,k+1);
  }

  out << l << "\n";
  for (k=1;k<=l&&k<=1000;++k) out << m[k] << " ";

  in.close();
  out.close();

  return 0;
}