#include <cstdio>
#include <cstring>

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

char match[MAXN];

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

    scanf("%s %s", A, B);
    NA = strlen(A);
    NB = strlen(B);

    P1 = P2 = 1;
    hashA1 = hashA2 = 0;
    for (int i = 0; i < NA; 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 (NA > NB)
    {
        printf("0\n");
        return 0;
    }

    int hash1 = 0, hash2 = 0;
    for (int i = 0; i < NA; 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 = NA; i < NB; i++)
    {
        hash1 = ((hash1 - (B[i - NA] * P1) % MOD1 + MOD1) * P + B[i]) % MOD1;
        hash2 = ((hash2 - (B[i - NA] * P2) % MOD2 + MOD2) * P + B[i]) % MOD2;

        if (hash1 == hashA1 && hash2 == hashA2)
            match[ i - NA + 1 ] = 1, Nr++;
    }
    printf("%d\n", Nr);

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

    return 0;
}
/*#include <cstdio>
#include <cstring>
#define MAXN 2000001
#define P 73
#define m1 666013
#define m2 686969
char a[MAXN], b[MAXN];
int nb, na;
int ca1,ca2,p1,p2;
char match[MAXN];
int main()
{
    freopen("strmatch.in", "r", stdin);
    freopen("strmatch.out", "w", stdout);
    scanf("%s %s", a, b);
    na = strlen(a);
    nb = strlen(b);

    p1 =1; p2 = 1;
    ca1 = ca2 = 0;
    for (int i = 0; i < na; i++)
    {
        ca1 = (ca1 * P + a[i]) % m1;
        ca2 = (ca1 * P + a[i]) % m2;

        if (i != 0)
            p1 = (p1 * P) % m1,
            p2 = (p2 * P) % m2;
    }

    if (na > nb)
    {
        printf("0\n");
        return 0;
    }

    int cb1 = 0, cb2 = 0;
    for (int i = 0; i < na; i++)
        cb1 = (cb1 * P + b[i]) % m1,
        cb2 = (cb2 * P + b[i]) % m2;

    int nr = 0;
    if (cb1 == ca1 && ca2 == cb2)
        match[0] = 1, nr++;

    for (int i = na; i < nb; i++)
    {
        cb1 = ((cb1 - (b[i - na] * p1) % m1 + m1) * P + b[i]) % m1;
        cb2 = ((cb2 - (b[i - na] * p2) % m2 + m2) * P + b[i]) % m2;

        if (cb1 == ca1 && ca2 == cb2)
            match[ i - na + 1 ] = 1, nr++;
    }
    printf("%d\n", nr);

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

    return 0;
}
/*#include <cstdio>
#include<cstring>
#define P 73
#define m1 666013
#define m2 686969
#define MAXN 2000010
using namespace std;
char a[MAXN],b[MAXN];
int v[MAXN];
int i,p1,p2,na,nb,nr,ca1,cb1,ca2,cb2;
int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    scanf("%s %s",&a,&b);
    na=strlen(a);
    nb=strlen(b);
    if(na>nb)
    {
        printf("0\n");
        return 0;
    }
  //  ca=cb=0;
  p1=1;
  p2=1;
    for(i=0;i<na;i++)
    {
        ca1=(ca1*P+a[i])%m1;
        ca2=(ca2*P+a[i])%m2;
        if(i!=0)
        {
            p1=(p1*P)%m1;
            p2=(p2*P)%m2;
        }
    }
    for(i=0;i<na;i++)
    {
        cb1=(cb1*P+b[i])%m1;
        cb2=(cb2*P+b[i])%m2;
    }
    if(cb1==ca1&&cb2==ca2)
    {
        v[0]=1;
        nr++;
    }
    for(i=na;i<nb;i++)
    {
        cb1=((cb1-(b[i-na]*p1)%m1+m1)*P+b[i])%m1;
        cb2=((cb2-(b[i-na]*p2)%m2+m2)*P+b[i])%m2;
        if(cb1==ca1&&cb2==ca2)
        {
            v[i-na+1]=1;
            nr++;
        }
    }
    printf("%d/n",nr);
    nr=0;
    for(i=0;i<nb&&nr<1000;i++)
    if(v[i])
    {
        nr++;
        printf("%d ",i);
    }
    printf("\n");
    return 0;
}*/