#include <bits/stdc++.h>
#define maxN 2000010
using namespace std;
char a[maxN], b[maxN];
int n, m, i, k, s[1005];
int urm[maxN], nr;
void prefix()
{
    urm[1]=0;
    k=0;
    for (i = 2; i <= n; i++)
    {
        while (k && a[i] != a[k+1]) k=urm[k];
        if (a[i] == a[k+1]) k++;
        urm[i]=k;
    }
}
int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    gets(a+1);
    gets(b+1);
    n = strlen(a+1);
    m = strlen(b+1);
    prefix();
    k=0;
    for (i = 1; i <= m; i++)
    {
        while (k && b[i] != a[k+1])
            k=urm[k];
        if (b[i] == a[k+1]) k++;
        if (k == n)
        {
            if (s[0]>=1000) s[0]++;
            else s[++s[0]]=i-n;
        }
    }
    printf("%d\n", s[0]);
    s[0] = min(s[0], 1000);
    for(i = 1; i <= s[0]; i++)
        printf("%d ", s[i]);
    return 0;
}