#include<fstream>
#include<iostream>
#include<vector>
#define NMax 2000005
using namespace std;

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

int M,N,q;
char A[NMax],B[NMax];
int pi[NMax];

vector <int> Sol;

void Read()
{
    fin.getline(A,NMax);
    fin.getline(B,NMax);

    while(A[M++]);  M--;
    while(B[N++]);  N--;

    for(int i = M ; i > 0 ; --i)
        A[i] = A[i-1];

    for(int i = N ; i > 0 ; --i)
        B[i] = B[i-1];

    A[0] = B[0] = ' ';
}

void Precalculate()
{
    pi[1] = 0;

    for(int i = 2 ; i <= M; ++i)
    {
        while(q && A[q+1] != A[i])
            q = pi[q];

        if(A[q+1] == A[i])
            q++;

        pi[i] = q;
    }
}

void KMP()
{
    q = 0;

    for(int i = 1; i <= N; ++i)
    {
        while(q && A[q+1] != B[i])
            q = pi[q];

        if(A[q+1] == B[i])
            q++;

        if(q == M)
        {
            q = pi[M];
            if(Sol.size() < 1000)
                Sol.push_back(i-M);
        }
    }
}

void Print()
{
    fout<<Sol.size()<<"\n";

    for(int i = 0 ; i < (int) Sol.size() ; ++i)
        fout<<Sol[i]<<" ";

    fout<<"\n";
}

int main(void)
{
    Read();
    Precalculate();
    KMP();
    Print();

    fin.close();
    fout.close();
    return 0;
}