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

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

string A,B;
vector < int > v;
int nA, nB;
vector < int > sol;
long long nr;

void citire()
{
    in>>A>>B;
    nA=A.size();
    nB=B.size();
}

void calc_v()
{
    v.resize(nA,0);
    int i=2,cnd=0;
    v[0]=-1;
    v[1]=0;
    while(i<nA)
    {
        if(A[i-1]==A[cnd])
        {
            cnd++;
            v[i]=cnd;
            i++;
        }
        else if(cnd)
            cnd=v[cnd];
        else
            i++;
    }
}

void rezolvare()
{
    int i=0,m=0;
    while(i+m<nB)
    {
        if(A[i]==B[i+m])
        {
            i++;
            if(i==nA)
            {
                nr++;
                if(sol.size()<1023)
                    sol.push_back(m);
                i--;
                if(v[i]>-1)
                {
                    m+=i-v[i];
                    i=v[i];
                }
                else
                {
                    i=0;
                    m++;
                }
            }
        }
        else
        {
            if(v[i]>-1)
            {
                m+=i-v[i];
                i=v[i];
            }
            else
            {
                i=0;
                m++;
            }
        }

    }
}

void afisare()
{
    out<<nr<<'\n';
    nr=min(nr,1000ll);
    for(int i=0;i<nr;i++)
        out<<sol[i]<<' ';

}

int main()
{
    citire();
    calc_v();
    rezolvare();
    afisare();
    return 0;
}