#include <cstdio>
#include <cstring>
#include <cassert>

#include <fstream>
#include <algorithm>
#include <vector>
#include <string>
#include <queue>
#include <map>

using namespace std;

typedef long long LL;
typedef vector<int>::iterator it;

const int oo = 0x3f3f3f3f;
const int MAX_N = 2000005;
const int MAX_MATCH = 1000;

int N, M, Pi[MAX_N], MatchCount;
char Pattern[MAX_N], String[MAX_N];
vector<int> MatchPositions;

void BuildPi() {
    Pi[1] = 0;
    for (int i = 1, p = 0; i < N; ++i) {
        for (; p > 0 && Pattern[i + 1] != Pattern[p + 1]; p = Pi[p]);
        p += (Pattern[i + 1] == Pattern[p + 1] ? 1 : 0);
        Pi[i + 1] = p;
    }
}

void KMP() {
    BuildPi();
    for (int i = 1, p = 0; i <= M; ++i) {
        for (; p > 0 && String[i] != Pattern[p + 1]; p = Pi[p]);
        p += (String[i] == Pattern[p + 1] ? 1 : 0);
        if (p == N) {
            ++MatchCount;
            if (MatchCount <= MAX_MATCH)
                MatchPositions.push_back(i - N + 1);
        }
    }
}

void Solve() {
    KMP();
}

void Read() {
    assert(freopen("strmatch.in", "r", stdin));
    assert(scanf("%s\n%s", Pattern + 1, String + 1) == 2);
    N = strlen(Pattern + 1);
    M = strlen(String + 1);
}

void Print() {
    assert(freopen("strmatch.out", "w", stdout));
    printf("%d\n", MatchCount);
    for (it P = MatchPositions.begin(); P != MatchPositions.end(); ++P)
        printf("%d ", *P - 1);
    printf("\n");
}

int main() {
    Read();
    Solve();
    Print();
    return 0;
}