#include<cstdio>
#include<string>
#include<cstring>

using namespace std;

#ifdef HOME
const string inputFile = "input.txt";
const string outputFile = "output.txt";
#else
const string problemName = "strmatch";
const string inputFile = problemName + ".in";
const string outputFile = problemName + ".out";
#endif

const int NMAX = 2000000 + 5;
const int BASE1 = 127;
const int BASE2 = 197;
const int MOD1 = (int)(1e6) + 3;
const int MOD2 = 666013;

int N, M;
int Z[NMAX];
char A[NMAX];
char B[NMAX];
int nr_matches;
int matches[1005];

void add(int i) {
    nr_matches++;
    if(nr_matches <= 1000)
        matches[nr_matches] = i - N;
}

void prepo() {
    int i, j, k, d, lo, hi;

    lo = hi = 0;

    for(i = 2; i <= N; i++) {
        if(hi <= i) {
            for(j = i, k = 1; j <= N && A[j] == A[k]; j++, k++);
            j--;
            k--;
            Z[i] = k;
            lo = i;
            hi = j;
        } else {
            d = (i - lo + 1);
            if(Z[d] < hi - i + 1)
                Z[i] = Z[d];
            else {
                for(j = hi, k = hi - i + 1; j <= N && A[j] == A[k]; j++, k++);
                j--;
                k--;
                Z[i] = k;
                lo = i;
                hi = j;
            }
        }
    }
}

void zalgo() {
    int i, j, k, d, lo, hi, z;

    lo = hi = z = 0;

    for(i = 1; i <= M; i++) {
        if(hi <= i) {
            for(j = i, k = 1; j <= M && B[j] == A[k]; j++, k++);
            j--;
            k--;
            z = k;
            lo = i;
            hi = j;
        } else {
            d = (i - lo + 1);
            if(Z[d] < hi - i + 1)
                z = Z[d];
            else {
                for(j = hi, k = hi - i + 1; j <= M && B[j] == A[k]; j++, k++);
                j--;
                k--;
                z = k;
                lo = i;
                hi = j;
            }
        }

        if(z == N)
            add(i);
    }
}

int main() {
    int i;

    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);

    scanf("%s", A + 1);
    scanf("%s", B + 1);

    N = strlen(A + 1);
    M = strlen(B + 1);

    prepo();
    zalgo();

    printf("%d\n", nr_matches);

    for(i = 1; i <= min(nr_matches, 1000); i++)
        printf("%d ", matches[i]);

    return 0;
}