#include <bits/stdc++.h>
using namespace std;
ifstream fin("strmatch.in");
ofstream fout("strmatch.out");
#define NMax 2000005
int N,M,len;
char A[NMax],B[NMax];
int lps[NMax] ,pos[1024];

void computeLPSarray(char* pat, int M, int* lps);

void KMPsearch(char* pat,char* txt)
{
    computeLPSarray(A, M, lps);
    int i = 0;
    int j = 0;
    while(i<N)
    {
        if (pat[j] == txt[i]){
            j++;
            i++;
        }
        if (j == M)
        {
            pos[++pos[0]] = i-j;
            j = lps[j - 1];
        }
        else if (i<N && pat[j] != txt[i]){
            if (j!=0)
                j = lps[j - 1];
            else
                i ++;
        }
    }
}
void computeLPSarray(char* pat,int M,int* lps)
{
    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++;
            }
        }
    }

}
int main()
{
    fin.getline(A,NMax);
    fin.getline(B,NMax);
    M = strlen(A);
    N = strlen(B);
    KMPsearch(A,B);
    fout << pos[0] << '\n';
    for (int i=1;i<=pos[0];i++)
        fout << pos[i] << " ";
    return 0;
}