#include <fstream>
#include <string>
#include <stdio.h>
#include <queue>

#define BAZA 27
#define MOD1 666013
#define MOD2 666019

using namespace std;

string pattern ;
string s ;
queue <int> st ;

int main() {

  ifstream fin ("strmatch.in" ) ;
  ofstream fout ("strmatch.out") ;
  int n, i, counter, P, Pattern, nr1, CP, nr2, P2, P1, Pattern1, Pattern2 ;
  fin >> pattern ;
  fin >> s ;
  P1 = 1 ;
  P2 = 1 ;
  Pattern1 = 0 ;
  Pattern2 = 0 ;
  for (i = 0 ; i < pattern.size() ; i++ ) {
    Pattern1 = ( ( ( Pattern1 % MOD1 ) * (BAZA % MOD1) ) % MOD1 + (pattern[i] - 'A' + 1 ) ) % MOD1 ;
    Pattern2 = ( ( ( Pattern2 % MOD2 ) * (BAZA % MOD2) ) % MOD2 + (pattern[i] - 'A' + 1 ) ) % MOD2 ;
    if (i != 0 ) {
      P2 = (P2 * BAZA) % MOD2  ;
      P1 = (P1 * BAZA) % MOD1  ;
    }
  }
 // fout << P << "\n" ;
  if (pattern.size() > s.size() ) {
    fout << "0" ;
  }
  else {
    nr1 = 0 ;
    nr2 = 0 ;
    for (i = 0 ; i < pattern.size() ; i++ ) {
      nr1 = ( (nr1 % MOD1 ) * (BAZA % MOD1) + ( s[i] - 'A' + 1 ) % MOD1 ) % MOD1 ;
      nr2 = ( (nr2 % MOD2 ) * (BAZA % MOD2) + ( s[i] - 'A' + 1 ) % MOD2 ) % MOD2 ;
    }
    //fout << "nr = " << nr << "\n" ;
    if (nr1 == Pattern1 && nr2 == Pattern2 )
        st.push(0) ;
    for (i = pattern.size() ; i < s.size() ; i++ ) {
      nr1 = ( nr1  - ( ( (s[i-pattern.size()]- 'A' + 1 ) % MOD1 ) * ( P1 % MOD1 ) % MOD1 ) + MOD1 ) % MOD1 ;
      nr1 = ( (nr1 * (BAZA % MOD1 ) ) % MOD1 + ( s[i] - 'A' + 1 ) % MOD1  ) % MOD1 ;
      nr2 = ( nr2  - ( ( (s[i-pattern.size()]- 'A' + 1 ) % MOD2 ) * ( P2 % MOD2 ) % MOD2 ) + MOD2 ) % MOD2 ;
      nr2 = ( (nr2 * (BAZA % MOD2 ) ) % MOD2 + ( s[i] - 'A' + 1 ) % MOD2  ) % MOD2 ;
      //fout << "i = " << i+1 << " nr = " << nr << "\n" ;
       if (nr1 == Pattern1 && nr2 == Pattern2 )
        st.push(i - pattern.size()) ;
    }
    fout << st.size() << "\n" ;
    while (!st.empty()) {
      fout << st.front()+1 << " " ;
      st.pop() ;
    }
  }
  return 0 ;
}