#include <iostream>
#include <algorithm>
using namespace std;
string a, b;
int v[200001], i, st, dr, nr = 1, poz = -1, poz_anterior = -1, cnt;
int main()
{
    ///ABA
   ///CABBCABABAB   CAUTA DE LA 0 LA FINAL GASESTE PE POZ 5 FACE CNT 1 ST DEVINE 5 V[1] = 5, CAUTA DE LA 6 LA FINAL GASESTE 7 CNT DEVINE 2 ST DEVINE 8 CAUTA DE LA 8 LA FINAL NU GASESTE NIMIC DA BREAK
    cin>>a;
    cin>>b;
    st = 0; dr = b.size();
    while(true){
        poz = b.find(a,  st);
        if(poz == string::npos)
        {
            break;
        }
        else
        {
            cnt++;
            st = poz + 1;
            v[nr] = poz;
            nr++;
            poz_anterior = poz;
        }
    }
    cout<<cnt;
    cout<<'\n';
    for(i=1; i<nr && i<=1000; i++)
    {
        cout<<v[i]<<' ';
    }
    return 0;
}