#include<cstdio>
#include<cstring>
#define MAX_N 2000000
#define MAX_POS 1000
using namespace std;

char P[MAX_N+1], T[MAX_N+1];
int pi[MAX_N], pos[MAX_POS], n, m, l;

void read() {
    FILE* fin = fopen("strmatch.in","r");
    fscanf(fin,"%s%s",P,T);
    n = strlen(T);
    m = strlen(P);
    fclose(fin);
}

void buildPrefix(int n) {
    int i, k = 0;
    pi[0] = 0;
    for(i = 1; i < n; i++) {
        while(k > 0 && P[i] != P[k])
            k = pi[k-1];
        if(P[i] == P[k])
            k++;
        pi[i] = k;
    }
}

void KMP(int n, int m) {
    int i, k = 0;
    for(i = 0; i < n; i++) {
        while(k > 0 && T[i] != P[k])
            k = pi[k-1];
        if(T[i] == P[k])
            k++;
        if(k == m) {
            if(l < MAX_POS)
                pos[l++] = i - m + 1;
            else l++;
        }
    }
}

void printOccurences() {
    FILE* fout = fopen("strmatch.out","w");
    fprintf(fout,"%d\n",l);
    if(l > MAX_POS)
        l = MAX_POS;
    for(int i = 0; i < l; i++)
        fprintf(fout,"%d ",pos[i]);
    fprintf(fout,"\n");
    fclose(fout);
}

int main() {
    read();
    buildPrefix(m);
    KMP(n,m);
    printOccurences();
    return 0;
}