#include <bits/stdc++.h>
#define mod 1000000007
#define mod2 1000000009
using namespace std;
ifstream f ("strmatch.in");
ofstream g ("strmatch.out");
const int nmax=2e6+3;
int n,t;
long long pwp,cod,usu,pwp2,cod2,usu2;
char s1[nmax],s[nmax];
vector <int> sol;
int main()
{
    f>>(s1+1);
    f>>(s+1);
    n=strlen(s1+1);
    t=strlen(s+1);
    if(n>t)
    {
        g<<0;
        return 0;
    }
    for(int i=1;i<=n;++i)
    {
        cod=(cod*133ll+s1[i])%mod;
        while(cod<0) cod+=mod;
        cod2=(cod2*133ll+s1[i])%mod2;
        while(cod2<0) cod2+=mod2;
    }
    pwp=1ll;
    pwp2=1ll;
    for(int i=1;i<n;++i)
    {
        pwp=pwp*133ll%mod;
        pwp2=pwp2*133ll%mod2;
    }
    for(int i=1;i<=t;++i)
    {
        if(i<=n) usu=(usu*133ll+s[i])%mod;
        else usu=(((usu-(s[i-n])*pwp%mod)%mod+mod)%mod*133+s[i])%mod;
        while(usu<0) usu+=mod;
        if(i<=n) usu2=(usu2*133ll+s[i])%mod2;
        else usu2=(((usu2-(s[i-n])*pwp2%mod2)%mod2+mod2)%mod2*133+s[i])%mod2;
        while(usu2<0) usu2+=mod2;
        if(i>=n&&usu==cod&&usu2==cod2)
        {
            sol.push_back(i-n+1);
        }
    }
    g<<sol.size()<<'\n';
    int nr=sol.size();
    if(nr>1000) nr=1000;
    for(int i=0;i<nr;++i) g<<sol[i]-1<<' ';
    return 0;
}