#include <cstdio>
#include <algorithm>

using namespace std;

char a[2000005];
char b[2000005];
int pa[2000005];
int rez[1004];
int lrez, la;

void processA()
{
    int k = 0;
    pa[1] = 0;
    int i;
    for(i = 2; a[i] != NULL; i++)
    {
        while(a[k + 1] != a[i] && k > 0) k = pa[k];
        if(a[k + 1] == a[i])
            k++;
        pa[i] = k;
    }
    la = i - 1;
}

void processB()
{
    int k = 0;
    for(int i = 1; b[i] != NULL; i++)
    {
        while(a[k + 1] != b[i] && k > 0) k = pa[k];
        if(a[k + 1] == b[i])
            k++;
        if(k == la)
        {
            rez[lrez++] = i - la;
            k = pa[k];
        }
    }
}

int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    scanf("%s%s", a + 1, b + 1);
    processA();
    processB();
    printf("%d\n", lrez);
    int lg = min(lrez, 1000);
    for(int i = 0; i < lg; i++)
        printf("%d ", rez[i]);
    return 0;
}