#include <bits/stdc++.h>

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

#define b1 83
#define mod1 666013
#define b2 79
#define mod2 666777

using namespace std;

int n, m, i, hsh1, hsh2, p1, p2, H1, H2;
int sol, poz[1005];

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);

    p1 = p2 = 1;
    for(i = 1;  i <= n; i++)
    {
        p1 = (1LL * p1 * b1) % mod1;
        p2 = (1LL * p2 * b2) % mod2;

        hsh1 = ( (1LL * hsh1 * b1) % mod1 + a[i] - '0' + 1 ) % mod1;
        hsh2 = ( (1LL * hsh2 * b2) % mod2 + a[i] - '0' + 1 ) % mod2;
    }

    b[0] = '0' - 1;
    for(i = 1; i <= m; i++)
    {
        H1 = ( (1LL * H1 * b1) % mod1 + b[i] - '0' + 1 ) % mod1;
        H2 = ( (1LL * H2 * b2) % mod2 + b[i] - '0' + 1 ) % mod2;
        if(i >= n)
        {
            H1 = (H1 - (1LL * p1 * (b[i - n] - '0' + 1)) % mod1 + mod1) % mod1;
            H2 = (H2 - (1LL * p2 * (b[i - n] - '0' + 1)) % mod2 + mod2) % mod2;

            if(H1 == hsh1 && H2 == hsh2)
            {
                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;
}