/**
 * Code by Patrick Sava
 * "Spiru Haret" National College of Bucharest
 **/

# include "fstream"
# include "cstring"
# include "vector"
# include "queue"
# include "bitset"
# include "algorithm"
# include "map"
# include "set"
# include "unordered_map"
# include "deque"
# include "string"
# include "iomanip"
# include "cmath"
# include "stack"
# include "cassert"

const char IN [ ] =  "strmatch.in" ;
const char OUT [ ] = "strmatch.out" ;

using namespace std ;

# define pb push_back
# define mp make_pair
# define FORN( a , b , c ) for ( register int a = b ; a <= c ; ++ a )
# define FORNBACK( a , b , c ) for ( register int a = b ; a >= c ; -- a )

ifstream cin ( IN ) ;
ofstream cout ( OUT ) ;

const int MAX = 4e6 + 14 ;

char sir [ MAX ] ;
int suf [ MAX ] ;

int cate ;
vector < int > sol ;

int main()
{
    cin >> ( sir + 1 ) ;
    int l = strlen ( sir + 1 ) ;
    sir [ l + 1 ] = '#' ;
    cin >> ( sir + l + 2 ) ;
    ///cout << ( sir + 1 ) ;
    suf [ 1 ] = 0 ;
    int n = strlen ( sir + 1 ) ;
    FORN ( i , 2 , n )
    {
        int k = suf [ i - 1 ] ;
        while ( k and sir [ i ] != sir [ k + 1 ] )
            k = suf [ k ] ;
        if ( sir [ i ] == sir [ k + 1 ] ) ++ k ;
        suf [ i ] = k ;
        if ( k == l ) {
            ++ cate ;
            if ( cate <= 1000 ) sol.pb ( i - l - 4 ) ;
        }
        //cout << k << ' ' ;
    }
    //cout << endl ;
    cout << cate << '\n' ;
    for ( auto x : sol )
        cout << x << ' ' ;
    return 0;
}