#include <iostream>
#include <fstream>
#include <string.h>
using namespace std;

ifstream in("strmatch.in");
ofstream out("strmatch.out");

int n, lt, lp;
char pattern[2000000];
char text[2000000];
int prefix[2000000];
int pos[1001];

void preprocess();
void KMP();
void output();

int main() {
    in >> pattern;
    in >> text;

    lp = strlen(pattern);
    lt = strlen(text);

    preprocess();
    KMP();
    output();

    return 0;
}


void preprocess() {
    int j = 0;
    prefix[0] = 0;

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

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

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

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


void output() {
    out << n << '\n';

    int mini = min(1000, n);
    for (int i = 1; i <= mini; ++i)
        out << pos[i] << " ";
}