#include <stdio.h>
#include <string.h>
#define MAXN 2000001
#define P 73
#define MOD1 100007
#define MOD2 100021

char a[MAXN], b[MAXN];
int n, m;
int hashA1, hashA2, P1, P2;
char match[MAXN];

int main()
{
freopen("strmatch.in", "rt", stdin);
freopen("strmatch.out", "wt", stdout);
scanf("%s %s", a, b);

NA = strlen(a);
NB = strlen(b);

P1 = P2 = 1;
hashA1 = hashA2 = 0;
for (int i = 0; i < n; i++)
{
    hashA1 = (hashA1 * P + a[i]) % MOD1;
    hashA2 = (hashA2 * P + a[i]) % MOD2;
    if (i != 0)
        P1 = (P1 * P) % MOD1,
        P2 = (P2 * P) % MOD2;
}

if (n > m)
{
    printf("0\n");
    return 0;

}
int hash1 = 0, hash2 = 0;
for (int i = 0; i < n; i++)
    hash1 = (hash1 * P + b[i]) % MOD1,
    hash2 = (hash2 * P + b[i]) % MOD2;

int Nr = 0;
if (hash1 == hashA1 && hash2 == hashA2)
    match[0] = 1, Nr++;

for (int i = n; i < m; i++)
{
    hash1 = ((hash1 - (b[i - n] * P1) % MOD1 + MOD1) * P + b[i]) % MOD1;
    hash2 = ((hash2 - (b[i - n] * P2) % MOD2 + MOD2) * P + b[i]) % MOD2;
    if (hash1 == hashA1 && hash2 == hashA2)
        match[ i - n + 1 ] = 1, Nr++;
}
printf("%d\n", Nr);
Nr = 0;
for (int i = 0; i < m && Nr < 1000; i++)
    if (match[i])
        Nr++,
printf("%d ", i);
printf("\n");

return 0;
}