#include <iostream>
#include <fstream>
#include <cstring>
#include <climits>
#include <vector>

using namespace std;

ifstream in("strmatch.in");
ofstream out("strmatch.out");

int const nmax = (int) 2e6;
int const base = 53;

typedef unsigned long long ull;

string s1, s2;
int nsol;
vector < int > sol;
ull hpre[nmax];

int main()
{
  in >> s1 >> s2;

  ull target = 0;
  ull shift = 1;
  for(int i = 0; i < s1.size(); i++) {
    target = target * base + (s1[i] - 'a');
    shift *= base;
  }

  hpre[0] = s2[0] - 'a';
  for(int i = 1; i < s2.size(); i++) {
    hpre[i] = hpre[i - 1] * base + (s2[i] - 'a');
  }

  //s1 = cdef
  //s2 = abcdef
  for(int i = 0; i <= s2.size() - s1.size(); i++) {
    ull found = hpre[i + s1.size() - 1];
    if(0 < i)
     found -= shift * hpre[i - 1];
    if(found == target) {
      nsol++;
      if(nsol <= 1000)
        sol.push_back(i);
    }
  }

  out << nsol << '\n';
  for(int i = 0; i < sol.size(); i++)
    out << sol[i] << ' ';

  in.close();
  out.close();
  return 0;
}

//2^2 = 100