#include <iostream>
#include <fstream>
#include <string>
#include <vector>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
string s1, s2;
vector <int> rez;
int l[2000005], n, m, num;
void kmp_preg()
{
    int i=2, j=1;
    while(i<=n)
    {
        int k=l[i-1];
        while(k>0 && s1[k+1]!=s1[i])
            k=l[k];
        if(s1[i]==s1[k+1]) k++;
        l[i]=k;
        i++;
    }
}
void KMP()
{
    if(m<n)  return;
    int i=1, k=0;
    while(i<=m)
    {
        while(k>0 && s1[k+1]!=s2[i])
            k=l[k];
        if(s1[k+1]==s2[i])  k++;
        if(k==n)
        {
            num++;
             if(num<1000) rez.push_back(i-k);
            k=l[k];
        }
        i++;
    }
}
int main()
{
    fin >> s1 >> s2;
    n=s1.length();
    m=s2.length();
    s1=' '+s1;
    s2=' '+s2;
    kmp_preg();
    //fout << s1 << "\n" << s2;
    KMP();
    fout << num << "\n";
    for(int i=0; i<rez.size() && i<1000; i++)  fout << rez[i] << " ";
   // for(int i=1; i<=n; i++)  fout << l[i] << " ";
    return 0;
}