#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");

string a, b;
int n, m, pi[2000001];

/*
j = cate caractere din pattern sunt potrivite acum.

La mismatch, nu revenim la 0 direct.
Pastram cea mai mare parte din ce am potrivit deja
care poate fi in continuare prefix de pattern.

Acea lungime este pi[j-1], deci facem:
j = pi[j-1].

Practic: "sarim" la urmatoarea potrivire partiala posibila.
*/
int main()
{
    fin>>a>>b;
    n=a.size();
    m=b.size();
    for (int i=1; i<n; i++)
    {
        int j=pi[i-1];
        while (j>0 and a[i]!=a[j])
        {
            j=pi[j-1];
        }
        if (a[i]==a[j])
        {
            j++;
        }
        pi[i]=j;
    }
    vector<int> rez;
    int cnt=0, j=0;
    for (int i=0; i<m; i++)
    {
        while (j>0 and b[i]!=a[j])
        {
            j=pi[j-1];
        }
        if (b[i]==a[j])
        {
            j++;
        }
        if (j==n)
        {
            cnt++;
            if (rez.size()<1000)
            {
                rez.push_back(i-n+1);
            }
            j=pi[j-1];
        }
    }
    fout<<cnt<<'\n';
    for (auto u:rez)
    {
        fout<<u<<" ";
    }


    return 0;
}