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

#define LMAX 2000001
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string A,B;
int pi[LMAX];
void citire()
{
    f>>A>>B;
    f.close();
}
int minim(int x, int y)
{
    if(x<y)
        return x;
    return y;
}
void prefix(int n)
{
    //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<=n;j++)
    {
        while(i>-1 && A[i+1]!=A[j])
            i=pi[i];
        if(A[i+1]==A[j])
            i++;
        pi[j]=i;
    }
}
void solutie()
{
    vector <int> sol;
    int i;
    prefix(A.size()-1);
    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.push_back(j-i);
            i=pi[i];
        }
    }
    g<<sol.size()<<'\n';
    for(i=0;i<minim(sol.size(),1000);i++)
        g<<sol[i]<<" ";
    g.close();
}
int main()
{
    citire();
    solutie();
    return 0;
}