#include <bits/stdc++.h>

#define INF (1 << 30)
#define LLINF (1LL << 62)
#define mod 666013

using namespace std;

int n, m, i, k;
int sol, poz[1005];
int pi[2000005];
char a[2000005], b[2000005];


int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);

    gets(a + 1); n = strlen(a + 1);
    gets(b + 1); m = strlen(b + 1);

    pi[1] = 0; k = 0;
    for(i = 2; i <= n; i++)
    {
        while(k > 0 && 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 > 0 && b[i] != a[k + 1])
            k = pi[k];

        if(b[i] == a[k + 1])
            k++;

        if(k == n)
        {
            sol++;
            if(sol <= 1000)
                poz[sol] = i - n + 1;
        }
    }

    printf("%d\n", sol);
    for(i = 1; i <= min(sol, 1000); i++)
        printf("%d ", poz[i] - 1);

    return 0;
}