#include <iostream>
#include <fstream>
#include <vector>

///#define minn(a,b) (a<b? a : b)

const int LMAX = 2e6 + 1;

std::string A,B;
int pi[LMAX];

inline unsigned int min(int a, int b)
{
    return (a<b) ? a : b;
}

void prefix()
{
    ///indexarea incepe de la 0 deci unele valori din alg sunt decrementate cu 1
    pi[0]=-1;
    int i=-1;
    for(unsigned int j=1;j<A.size();j++)
    {
        while(i>-1 && A[i+1]!=A[j])
            i=pi[i];
        if(A[i+1]==A[j])
            i++;
        pi[j]=i;
    }
}
int main()
{
    {
        std::ifstream f("strmatch.in");
        f>>A>>B;
    }
    std::ofstream g("strmatch.out");

    std::vector <int> sol;
    prefix();
    int i=-1;

    int Asize = A.size() - 1;
    for(unsigned int j=0;j<B.size();j++)
    {
        while(i>-1 && A[i+1]!=B[j])
            i=pi[i];
        if(A[i+1]==B[j])
            i++;
        if(i==Asize && sol.size()<1000)
        {
            sol.emplace_back(j-i);
            i=pi[i];
        }
    }
    g<<sol.size()<<'\n';
    unsigned int limit = min(sol.size(),1000);
    for(unsigned i=0;i<limit;i++)
        g<<sol[i]<<" ";
    return 0;
}