#include <iostream>
#include <bits/stdc++.h>
#include <fstream>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
string a, b;
vector<int> p, res;
int x, y;
void prefix() /// calculeaza prefixul substringului
{
    p.resize(b.size()+3, 0);
    int k=0, i;
    p[1]=0;
    for(i=2;i<=y;i++)
    {
        while(k&&b[i]!=b[k+1])
            k=p[i];
        if(b[i]==b[k+1])
            k++;
        p[i]=k;
    }
}
bool KMP() /// cautare cu algoritmul Knuth-Morris-Pratt
{
    x=a.size();
    y=b.size();
    a=' '+a;
    b=' '+b;
    prefix();
    int k=0, i;
    for(i=1;i<=x;i++)
    {
        while(k&&a[i]!=b[k+1])
            k=p[k];
        if(a[i]==b[k+1])
            k++;
        if(k==y)
            res.push_back(i-k);
    }
    return 0;
}
int main()
{
    getline(f, b);
    getline(f, a);
    KMP();
    g<<res.size()<<'\n';
    for(auto x:res)
        g<<x<<' ';
    f.close();
    g.close();
    return 0;
}