#include <bits/stdc++.h>
#define mod 698695723
#define mod2 536557673
#define p 21564321
using namespace std;
ifstream in("strmatch.in");
ofstream out("strmatch.out");
char a[2000005],b[2000005];
long long nr1,nr2,cs1,cs2,sta,stb;
vector <int> sol;
int main()
{
    in >> a;
    in >> b;
    long long pr=1,p2=1;
    sta=strlen(a);
    stb=strlen(b);
    if(sta>stb)
    {
        out << "0\n";
        return 0;
    }
    for(int i=0; i<sta; i++)
    {
        nr1=(nr1*p+a[i])%mod;
        nr2=(nr2*p+a[i])%mod2;
        cs1=(cs1*p+b[i])%mod;
        cs2=(cs2*p+b[i])%mod2;
        pr=pr*p%mod;
        p2=p2*p%mod2;
    }
    if(nr1==cs1 && nr2==cs2)
    {
        sol.push_back(0);
    }
    int nr=0;
    for(int i=sta; i<stb; i++)
    {
        cs1=(cs1*p-(pr*b[i-sta])%mod+b[i])%mod;
        while(cs1<0)
            cs1+=mod;
        cs2=(cs2*p-(p2*b[i-sta])%mod2+b[i])%mod2;
        while(cs2<0)
            cs2+=mod2;
        if(nr1==cs1 && nr2==cs2)
        {
            sol.push_back(i-sta+1);
        }
    }
    out << sol.size() << '\n';
    int pol=sol.size();
    for(int i=0; i<min(pol,1000); i++)
    {
        out << sol[i] << ' ';
    }
    return 0;
}