#include <bits/stdc++.h>
#define N_MAX 2000005
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
int n,m,lps[N_MAX];
char a[N_MAX],b[N_MAX];
int sol[1005];
void prelucrare()
{
    int k=0;
    for(int i=1; i<n; i++)
    {
        if(a[i]==a[k])
        {
            k++;
        }
        else
        {
            k=0;
            if(a[i]==a[k])
                k++;
        }
        lps[i]=k;
    }
}
void kmp()
{
    int k=0;
    for(int i=0; i<m; i++)
    {
        while( k != 0 && (a[k] != b[i]) )
            k = lps[max(k - 1, 0)];
        if(a[k]==b[i])
        {
            k++;
        }
        if(k==n)
        {
            sol[min(++sol[0],1001)]=i-n+1;
            k=lps[n-1];
        }
    }
}
int main()
{
    in >> a;
    n=strlen(a);
    in >> b;
    m=strlen(b);
    prelucrare();
    kmp();
    out << sol[0] << '\n';
    for(int i=1; i<=min(sol[0],1000); i++)
    {
        out << sol[i] << ' ';
    }
    return 0;
}