#include <algorithm>
#include <cstdio>
#include <cstring>

using namespace std;

const int N=2000005;

char a[N], b[N];
int pi[N], ap[1005];

int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    int n, m, i, k, sol=0;
    fgets(a+1, N, stdin); n=strlen(a+1)-1;
    fgets(b+1, N, stdin); m=strlen(b+1)-1;
    k=0;
    for(i=2;i<=n;i++)
    {
        while(k&&a[i]!=a[k+1]) k=pi[k];
        if(a[i]==a[k+1]) k++;
        pi[i]=k;
    }
    k=0;
    for(i=1;i<=m;i++)
    {
        while(k&&b[i]!=a[k+1]) k=pi[k];
        if(b[i]==a[k+1]) k++;
        if(k==n)
        {
            sol++;
            if(sol<=1000) ap[sol]=i-n;
        }
    }
    printf("%d\n", sol);
    for(i=1;i<=min(sol, 1000);i++) printf("%d ", ap[i]);
}