#include <fstream>
#include <cstring>
#define MAX 2000002
using namespace std;

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

string A, B;
int p[MAX], N, aux[MAX], n, m, k;


void Read();
void Potrivire();
void KMP();
void Write();

int main()
{
    Read();
    Potrivire();
    KMP();
    Write();
    is.close();
    os.close();
    return 0;
}
void Read()
{
    getline(is, A);
    getline(is, B);
    m = A.length();
    n = B.length();
}
void Potrivire()
{

    for ( int i = 1; i < m; ++i )
    {
        while ( k > 0 && A[k] != A[i] )
            k = p[k-1];
        if ( A[k] == A[i] )
            k++;
        p[i] = k;
    }
}
void KMP()
{
    k = 0;
    for ( int i = 0; i < n; ++i )
    {
        while ( k > 0 && A[k] != B[i] )
            k = p[k-1];
        if ( A[k] == B[i] )
            k++;
        if ( k == m )
            aux[N++] = i-k+1;
    }
}
void Write()
{
    os << N << '\n';
    for ( int i = 0; i < N; ++i )
        os << aux[i] << ' ';
}