#include <iostream>
#include <fstream>
#include <string>
#include <vector>

using namespace std;

int main()
{
    string s, w;
    vector <int> sol;
    ifstream in("strmatch.in");
    in >> w >> s;
    in.close();
    int i, j, next = 0, nexti, wlen = w.length(), slen = s.length(), cnt = 0;
    bool before;
    while(next + wlen <= slen)
    {
        before = false;
        j = 0;
        for (i = next; i < wlen + next; ++i)
        {
            if(s[i] == w[0] && i > next && !before)
            {
                nexti = i;
                before = true;
            }
            if(s[i] != w[j++])
            {
                if(!before)
                    next = i + 1;
                else
                    next = nexti;
                break;
            }

            if(j == wlen)
            {
                ++cnt;
                if (sol.size() < 1000)
                    sol.push_back(i-wlen+1);
                if(!before)
                    next = i + 1;
                else
                    next = nexti;
                break;
            }
        }
    }

    ofstream out("strmatch.out");
    out << cnt << "\n";
    int f = sol.size();
    for (int i = 0; i < f; ++i)
        out << sol[i] << " ";
    out.close();
    return 0;
}