#include <bits/stdc++.h>

using namespace std;

int sol[1001];
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int i, p = -1, ns = 0;
string a, b;

int main()
{
    f >> a >> b;
    while(true){
        p = b.find(a, p+1);
        if(p == -1)
            break;
        ns++;
        if(ns<=1000)
            sol[ns] = p;
    }
    g << ns << "\n";
    ns = min(ns, 1000);
    for(i=1; i<=ns; i++)
        g << sol[i] << " ";
    g << "\n";
}