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