#include <fstream>
#include <string>

using namespace std;

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

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) 
  {
   m[++l]=k+1;
   k=szoveg.find(minta,k+1);
  }  
  
  out << l << "\n";
  for (k=1;k<=l;++k) out << m[k] << " ";
  
  in.close();
  out.close();
  return 0;    
}