//pattern matching
//KMP-in O(n+m)
#include<iostream>
#include<cstring>
#include<fstream>
#define N 2000005
using namespace std;

char P[N],T[N];
int m,n,poz[N],st[1024];

void citire()
{
    int i;
    ifstream fin("strmatch.in");
    fin.getline(P,sizeof(P));
    fin.getline(T,sizeof(T));
    for (; (P[m] >= 'A' && P[m] <= 'Z') || (P[m] >= 'a' && P[m] <= 'z')

			|| (P[m] >= '0' && P[m] <= '9'); ++m);

	for (; (T[n] >= 'A' && T[n] <= 'Z') || (T[n] >= 'a' && T[n] <= 'z')

			|| (T[n] >= '0' && T[n] <= '9'); ++n);

	for (i = m; i; --i) P[i] = P[i-1];

	for (i = n; i; --i) T[i] = T[i-1];
    P[0]=' ';
    T[0]=' ';

    fin.close();

}


void constr()
{
    poz[1]=0;
    int k=0;
    for(int q=2;q<=m;q++)
    {
        while(k>0 && P[k+1]!=P[q])
            k=poz[k];
        if(P[k+1]==P[q]) k++;
        poz[q]=k;
    }

}

void KMP()
{
    int q=0,i,ans=0;
    for(i=1;i<=n;i++)
    {
        while(q && P[q+1]!=T[i])
            q=poz[q];
        if(P[q+1]==T[i]) q++;
        if(q==m)
           {
               //cout<<i-m<<' ';
               q=poz[q];
               ans++;
               st[ans]=i-m;
               if(ans==1000)
                break;

           }

    }
    ofstream fout("strmatch.out");
    fout<<ans<<endl;
    for(i=1;i<=min(1000,ans);i++)
        fout<<st[i]<<' ';
    fout.close();


}



int main()
{
    citire();
    constr();
    //for(int i=1;i<=m;i++) cout<<poz[i]<<' ';
    KMP();
}