#include <bits/stdc++.h>
#define MOD 1000000001
#define baza 73
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
long long n,n1,i,sum,sum1,nr,v[2000005];
int val (char x)
{
    return int(x)-65;
}
long long ridput (long long a,long long b,long long mod)
{
    if (b==0)
    {
        return 1;
    }
    long long rez=ridput(a,b/2,mod);
    if (b%2==0)
    {
        return (rez*rez)%mod;
    }
    return ((rez*rez)%mod*a)%mod;
}
int main()
{
    f.getline (a,2000005);
    f.getline (b,2000005);
    n=strlen(a);
    n1=strlen(b);
    for (i=0;i<n;i++)
    {
        sum=(sum+(ridput(baza,i,MOD)*val(a[i]))%MOD)%MOD;
    }
    for (i=0;i<n&&i<n1;i++)
    {
        sum1=(sum1+(ridput(baza,i,MOD)*val(b[i]))%MOD)%MOD;
    }
    if (sum1==sum)
    {
        nr++;
        v[nr]=i;
    }
    for (i=n;i<n1;i++)
    {
        sum1=sum1/baza;
        sum1=(sum1+(ridput(baza,n-1,MOD)*val(b[i]))%MOD)%MOD;
        if (sum1==sum)
        {
            nr++;
            v[nr]=i-n+1;
        }
        if (nr==1000)break;
    }
        g<<nr<<'\n';
    for (i=1;i<=nr;i++)
    {
        g<<v[i]<<" ";
    }
    return 0;
}