#include<bits/stdc++.h>

using namespace std;

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

char a[2000006],b[2000006];
int p=31,mod=1000007;

void citire()
{
    fin>>a>>b;
}

void solve()
{
    int hasha=0,hashb=0,c=1;
    vector<int> sol;
    for(int i=0;i<strlen(a);i++)
    {
        hasha=hasha*p+a[i];
        hasha=hasha%mod;
        c=c*p%mod;
    }
    for(int i=0;i<strlen(a);i++)
    {
        hashb=hashb*p+b[i];
        hashb=hashb%mod;
    }
    if(hasha==hashb)
    {
        sol.push_back(0);
    }
    for(int i=strlen(a);i<strlen(b);i++)
    {
        hashb=(mod+(hashb*p)%mod-(b[i-strlen(a)]*c)%mod+b[i])%mod;
        if(hasha==hashb)
        {
            sol.push_back(i-strlen(a)+1);
        }
    }

    fout<<sol.size()<<"\n";
    for(int i=0;i<min(int(sol.size()),1000);i++)
        fout<<sol[i]<<" ";
}

int main()
{
    citire();
    solve();
    return 0;
}