#include<fstream>
#include<iostream>
#include<vector>
#include <cstdio>
#include <string>
#include <algorithm>
using namespace std;

vector<int> matches;
string sir, subsir;
int pi[1000000];

int main()
{
    ifstream fin ("strmatch.in");
    ofstream fout("strmatch.out");

    getline(fin, subsir);
    getline(fin, sir   );
    subsir.insert(subsir.begin(),'-');
    sir.insert(sir.begin(),'-');
    //cerr<<sir<<'\n'<<subsir;
    if (sir.size()<subsir.size()) {
        fout<<0<<'\n';
        return 0;
    }

    int k=0;
    pi[1]=0;
    for(int i=2; i<subsir.length(); ++i) {
        while(k>0 && subsir[i] != subsir[k+1])
            k=pi[k];
        if(subsir[i] == subsir[k+1])
            k++;
        pi[i]=k;
    }

    k=0;
    int nr=0;
    for(int i=1; i<sir.length(); ++i) {
        while(k>0   &&  sir[i] != subsir[k+1])
            k=pi[k];
        if(sir[i]   ==  subsir[k+1])
            k++;
        if(k==subsir.length()-1) { //match
            if(matches.size()<1000) {
                matches.push_back(i-subsir.length()+1);
            }
            nr++;
        }
    }

    fout<<nr<<'\n';
    for(int i=0; i<matches.size(); ++i) {
        fout<<matches[i]<<' ';
    }
    fout<<'\n';
    fout.close();
    return 0;
}