#include <fstream>
#include <string>

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 = -1;
  k = szoveg.find(minta, 0);
  int offset = 0;
  while (k != string::npos && l < 1000)
  {
    ++l;
    m[l] = offset + k;
    offset += k + 1;
    szoveg = szoveg.substr(k + 1);
    k = szoveg.find(minta, 0);
  }

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

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

  return 0;
}