#include <bits/stdc++.h>
using namespace std;

ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

char a[2000010], b[2000010];
const long long p=31, mod=145367;
long long stra, strb;

void citire()
{
    fin>>a>>b;
    stra=strlen(a);
    strb=strlen(b);
}

void solve()
{
    int hasha=0, hashb=0, c=1;
    vector<int>sol;
    for(int i=0; i<stra; i++)
    {
        hasha=hasha*p+a[i];
        hasha=hasha%mod;
        c=c*p%mod;
    }
    for(int i=0; i<stra; i++)
    {
        hashb=hashb*p+b[i];
        hashb%=mod;
    }
    if(hasha==hashb)
    {
        sol.push_back(0);
    }
    for(int i=stra; i<strb; i++)
    {
        hashb=(mod+(hashb*p)%mod-(b[i-stra]*c)%mod+b[i])%mod;
        if(hasha==hashb)
        {
            sol.push_back(i-stra+1);
        }
    }
    fout<<sol.size()<<'\n';
    for(int i=0; i<min(int(sol.size()), 1000); i++)
    {
        fout<<sol[i]<<' ';
    }
}

int main()
{
    citire();
    if(stra>strb)
    {
        fout<<0;
        return 0;
    }
    solve();
    return 0;
}