#include <bits/stdc++.h>
using namespace std;
ifstream f ("strmatch.in");
ofstream g ("strmatch.out");
const int nmax=2e6+3;
char s1[nmax],s2[nmax];
int n1,n2,k,ant[nmax],t;
vector <int> sol;
int main()
{
    f>>s1+1;
    f>>s2+1;
    n1=strlen(s1+1);
    n2=strlen(s2+1);
    t=n1;
    s1[++t]='#';
    for(int i=1;i<=n2;++i) s1[++t]=s2[i];
    k=0;
    for(int i=2;i<=t;++i)
    {
        while(k&&s1[i]!=s1[k+1]) k=ant[k];
        if(s1[i]==s1[k+1]) ++k;
        if(k==n1&&i-k-n1-1!=1)
        {
            sol.push_back(i-k-n1-1);
            if(sol.size()==1000) break;
            k=ant[k];
        }
        ant[i]=k;
    }
    g<<sol.size()<<'\n';
    for(int i=0;i<sol.size();++i) g<<sol[i]<<' ';
    return 0;
}