#include<algorithm>
#include<bitset>
#include<cmath>
#include<cstdio>
#include<cstdlib>
#include<cstring>
#include<ctime>
#include<deque>
#include<fstream>
#include<iomanip>
#include<iostream>
#include<map>
#include<queue>
#include<set>
#include<stack>
#include<unordered_map>
#include<unordered_set>
#include<utility>
#include<vector>

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;

int N, M;
char A[NMAX];
char B[NMAX];
int Z[NMAX];
int nrP, P[1005];

void calc_z() {
    int i, j, k, L, R;

    L = R = 0;

    for(i = 2; i <= N; i++) {
        if(i >= R) {
            L = i;
            for(j = 1, R = i; A[j] == A[R]; j++, R++);
            R--;
            Z[i] = R - L + 1;
        } else {
            k = i - L + 1;
            if(i + Z[k] - 1 < R)
                Z[i] = Z[k];
            else {
                L = i;
                for(j = 1, R = i; A[j] == A[R]; j++, R++);
                R--;
                Z[i] = R - L + 1;
            }
        }
    }
}

void z_algo() {
    int i, j, k, L, R, z;

    L = R = 0;

    for(i = 1; i <= M; i++) {
        if(i >= R) {
            L = i;
            for(j = 1, R = i; A[j] == B[R]; j++, R++);
            R--;
            z = R - L + 1;
        } else {
            k = i - L + 1;
            if(i + Z[k] - 1 < R)
                z = Z[k];
            else {
                L = i;
                for(j = 1, R = i; A[j] == B[R]; j++, R++);
                R--;
                z = R - L + 1;
            }
        }

        if(z == N) {
            nrP++;
            if(nrP <= 1000)
                P[nrP] = i - 1;
        }
    }
}

int main() {
    int i;

#ifndef ONLINE_JUDGE
    freopen(inputFile.c_str(), "r", stdin);
    freopen(outputFile.c_str(), "w", stdout);
#endif

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

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

    calc_z();
    z_algo();

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

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

    return 0;
}