#include <bits/stdc++.h>

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

using namespace std;

int n, m, i, rgt, lst;
int sol, poz[1005];
int dp[4000005];
char a[4000005];

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

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

    rgt = 1; lst = 1;
    for(i = 2; i <= m; i++)
    {
        if(rgt >= i)
            dp[i] = min(dp[i - lst + 1], rgt - i + 1);

        dp[i]++;

        while(a[ dp[i] ] == a[i + dp[i] - 1] && i + dp[i] - 1 <= m)
            dp[i]++;

        dp[i]--;

        if(i + dp[i] - 1 > rgt)
        {
            rgt = i + dp[i] - 1;
            lst = i;
        }

        if(i > n && dp[i] >= n)
        {
            sol++;
            if(sol <= 1000)
                poz[sol] = i - n;
        }
    }

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