#include <bits/stdc++.h>

using namespace std;

ifstream f("strmatch.in");
ofstream g("strmatch.out");
char a[2000005],b[2000005];
int n,phi[2000005],j,m,rasp,i;
vector <int> Ans;
void prefix()
{
    int l=0;
    for(i=2;i<n;i++)
    {
        while(l&&a[i]!=a[l+1])
        l=phi[l];
        if(a[l+1]==a[i])
        l++;
        phi[i]=l;
    }
}
void Kmp()
{
    for(i=1,j=0;i<=m;i++)
    {
        while(j&&b[i]!=a[j+1])
            j=phi[j];
        if(b[i]==a[j+1])
            j++;
        if(j==n-1){
            rasp++;
        if(rasp<=1000)
            Ans.push_back(i-n+1);}
    }
}
int main()
{
    f>>a>>b;
    n=strlen(a);
    m=strlen(b);
    prefix();
    Kmp();
    g<<rasp<<"\n";
    for(i=0;i<Ans.size();i++)
        g<<Ans[i]<<" ";
    return 0;
}