#include <iostream>
#include <fstream>
#include <vector>
#include <queue>
#include <set>
#include <algorithm>
#include <list>
#include <map>
#include <math.h>
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int main() {
    string a , b;
    f>>a>>b;
    int contor =0 ;
    vector<size_t> pozitii;
    size_t found = b.find(a);
    while(found != string::npos)
    {
        contor++;
        pozitii.push_back(found);
        found = b.find(a,found+1);
    }
    g<<contor<<"\n";
    for(int i=0;i<pozitii.size();i++)
    g<<pozitii[i]<<" ";
    return 0;
}