#include <iostream>
#include <fstream>
#include <vector>
using namespace std;

#define minn(a,b) (a<b? a : b)
const int LMAX=2e6 + 1;

string A,B;
int pi[LMAX];
void prefix()
{
    //indexarea incepe de la 0 deci unele valori din alg sunt decrementate cu 1
    pi[0]=0;
    int i=-1;
    for(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()
{
    ifstream f("strmatch.in");
    ofstream g("strmatch.out");
    f>>A>>B;
    f.close();
    vector <int> sol;
    prefix();
    int i=-1;
    for(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==A.size()-1 && sol.size()<1000)
        {
            sol.push_back(j-i);
            i=pi[i];
        }
    }
    g<<sol.size()<<'\n';
    for(i=0;i<minn(sol.size(),1000);i++)
        g<<sol[i]<<" ";
    g.close();
    return 0;
}