#include<iostream>
#include<fstream>
#include<vector>
#define NMax 2000005
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

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

vector <int> Sol;

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

    while(A[++N]);

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

    while(B[++M]);

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

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

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

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

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

        pi[i] = nrp;
    }
}

void KMP()
{
    nrp = 0;

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

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

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

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

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

    fout<<"\n";
}

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

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