#include <iostream>
#include <fstream>
#include <cstring>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
vector<int>sol;
const int nmax=2000000;
char patern[nmax+5]; int n;
char s[nmax+5]; int m;
int prefix_sufix[nmax+5];
inline void build_prefix_sufix()
{
    int len=0;
    prefix_sufix[0]=0;
    int i=1;
    while(i<m)
    {
        if(patern[i]==patern[len])
        {
            len++;
            prefix_sufix[i]=len;
            i++;
        }
        else
        {
            if(len!=0)
            {
                len=prefix_sufix[len-1];
            }
            else
            {
                len=0;
                i++;
            }
        }
    }
}
void KMP()
{
    int i=0;
    int j=0;
    while(i<n)
    {
        if(patern[j]==s[i])
        {
            j++;
            i++;
        }
        if(j==m)
        {
            sol.push_back(i-m);
            j=prefix_sufix[j-1];
        }
        else
        {
            if(i<n and patern[j]!=s[i])
            {
                if(j!=0)
                    j=prefix_sufix[j-1];
                else
                    i++;
            }
        }
    }
}
int main()
{
    fin.getline(patern,nmax+5);
    m=strlen(patern);
    fin.getline(s,nmax+5);
    n=strlen(s);
    build_prefix_sufix();
    KMP();
    fout<<sol.size()<<"\n";
    int gata=sol.size();
    if(gata>1000)
        gata=1000;
    for(int i=0;i<gata;i++)
        fout<<sol[i]<<" ";
    return 0;
}