#include <stdio.h>
#include <string.h>

#define MAXN 2000001

#define P 73
#define MOD1 100007
#define MOD2 100021

char A[MAXN], B[MAXN];
int NA, NB;

int hashA1, hashA2, P1, P2, hash1, hash2;

char match[MAXN];

int cod(char x){
    if(x >= 'A' && x <= 'Z')
        return (x - 'A');
    else
        return (x - 'A' - 6);
}

int main(){
    int i, j, ver, curr;
    freopen("strmatch.in", "rt", stdin);
    freopen("strmatch.out", "wt", stdout);

    scanf("%s %s", A, B);
    NA = strlen(A);
    NB = strlen(B);
//    printf("%d ... %d   %d ... %d\n", cod('A'), cod('Z'), cod('a'), cod('z'));
    if (NA > NB){
        printf("0\n");
        return 0;
    }

    P1 = 1;
    P2 = 1;
    hashA1 = cod(A[0]);
    hashA2 = cod(A[0]);
    hash1 = cod(B[0]);
    hash2 = cod(B[0]);
    for (i = 1; i < NA; i++){

        hashA1 = (hashA1 * P + cod(A[i])) % MOD1;
        hashA2 = (hashA2 * P + cod(A[i])) % MOD2;
        hash1 = (hash1 * P + cod(B[i])) % MOD1;
        hash2 = (hash2 * P + cod(B[i])) % MOD2;

        P1 = (P1 * P) % MOD1;
        P2 = (P2 * P) % MOD2;

    }

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

    for (i = NA; i < NB; i++){

        hash1 = ((hash1 - (cod(B[i - NA]) * P1) % MOD1 + MOD1) * P + cod(B[i])) % MOD1;
        hash2 = ((hash2 - (cod(B[i - NA]) * P2) % MOD2 + MOD2) * P + cod(B[i])) % MOD2;

        if (hash1 == hashA1 && hash2 == hashA2){
            ver = 1;
            curr = 0;
            for(j = i - NA + 1; j <= i && ver == 1; j++)
                if(A[curr++] != B[j])
                    ver = 0;
            if(ver == 1){
                match[ i - NA + 1 ] = 1;
                Nr++;
            }
        }
    }
    printf("%d\n", Nr);

    Nr = 0;
    for (i = 0; i < NB && Nr < 1000; i++)
        if (match[i])
            Nr++,
            printf("%d ", i);
    printf("\n");

    return 0;
}