#include <bits/stdc++.h>
#define MAX 200000

using namespace std;

void computeLPSArray(string pat, int M, int* lps)
{
    int len = 0;
    lps[0] = 0;
    int i = 1;
    while (i < M) {
        if (pat[i] == pat[len]) {
            len++;
            lps[i] = len;
            i++;
        }
        else{
            if (len != 0) {
                len = lps[len - 1];
            }
            else{
                lps[i] = 0;
                i++;
            }
        }
    }
}

void KMPSearch(string pat, string txt)
{
    ofstream out;
    out.open("strmatch.out");
    int M = pat.length();
    int N = txt.length();
    int lps[M];
    computeLPSArray(pat, M, lps);
    int i = 0,j = 0;
    int answer[MAX],ind =0;
    while (i < N) {
        if (pat[j] == txt[i]) {
            j++;
            i++;
        }
        if (j == M) {
            answer[ind++]=i - j;
            j = lps[j - 1];
        }
        else if (i < N && pat[j] != txt[i]) {
            if (j != 0)
                j = lps[j - 1];
            else
                i++;
        }
    }
    out << ind <<endl;
    for(i = 0; i != min(ind,1000); i++){
        out <<answer[i]<<" ";
    }

}


int main(){
    ifstream in;
    in.open("strmatch.in");
    string pat,txt;
    getline (in, pat);
    getline (in, txt);
    KMPSearch(pat, txt);
    return 0;
}