#include <fstream>
#include <string>
using namespace std;

int n, lt, lp;
string text, pattern;
int prefix[2000001];
int pos[1001];

int main() {
    ifstream in("strmatch.in");

    getline(in, pattern);
    getline(in, text);
    in.close();

    lp = pattern.size();
    lt = text.size();;

    //preprocess();
    int j = 0;
    prefix[0] = 0;

    for (int i = 1; i < lp; ++i) {
        while (j > 0 && pattern[i] != pattern[j]) {
            j = prefix[j - 1];
        }

        if (pattern[i] == pattern[j]) {
            ++j;
        }

        prefix[i] = j;
    }

    //KMP();
    j = 0;
    for (int i = 0; i < lt; ++i) {
        while (j > 0 && text[i] != pattern[j]) {
            j = prefix[j - 1];
        }

        if (text[i] == pattern[j]) {
            ++j;
            if (j == lp) {
                if (++n <= 1000) pos[n] = i - lp + 1;
                j = prefix[j - 1];
            }
        }
    }

    //output();
    ofstream out("strmatch.out");
    out << n << '\n';

    int mini = (n < 1000) ? n : 1000;
    for (int i = 1; i <= mini; ++i)
        out << pos[i] << ' ';

    out.close();

    return 0;
}