#include <iostream>
#include <cstdio>
#include <algorithm>
#include <cstring>
#define N 2000005
#define mod 101
#define baza 256

using namespace std;

char a[N], b[N];
int sol[N], n, m, l;

int comp(int k)
{
   for(int i=1;i<=n;i++)
   {
        if(a[i]!=b[k])
            return 0;
        k++;
   }
   return k-1;
}

void hasis()
{
    int p=1, hA=a[1]%mod, h=b[1]%mod;
    for(int i=2;i<=n;i++)
    {
        hA=(hA*baza+a[i])%mod;
        h=(h*baza+b[i])%mod;
        if(i!=1)
            p=(p*baza)%mod;
    }
    for(int i=n+1;i<=m;i++)
    {
        h=(((h-(b[i-n]*p)%mod+mod)*baza%mod)+b[i])%mod;
        if(h==hA && comp(i-n+1)==i)
            sol[++l]=i-n;
    }
}

void afisare()
{
    printf("%d\n", l);
    int nr=min(l, 1000);
    for(int i=1;i<=nr;i++)
            printf("%d ", sol[i]);
}

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

    fgets(a+1, N, stdin);
    fgets(b+1, N, stdin);
    n=strlen(a+1)-1;
    m=strlen(b+1)-1;
    hasis();
    afisare();
    return 0;
}