#include <stdio.h>
#include <stdlib.h>

void KMPSearch(char* pat, char* txt,FILE* g)
{
    int cnt=0;
    int M = strlen(pat);
    int N = strlen(txt);
    int lps[M];
    computeLPSArray(pat, M, lps);
    int k=0;
    int p[N-M];
    int i = 0;
    int j = 0;
    while (i < N)
    {
        if (pat[j] == txt[i])
        {
            j++;
            i++;
        }

        if (j == M)
        {
            cnt++;
            p[k]=i-j;
            k++;
            j = lps[j - 1];
        }
        else if (i < N && pat[j] != txt[i])
        {
            if (j != 0)
                j = lps[j - 1];
            else
                i = i + 1;
        }
    }
    fprintf(g,"%d",cnt);
    fprintf(g,"\n");
    for(int i=0; i<k; i++)
        fprintf(g,"%d ",p[i]);
}

void computeLPSArray(char* 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++;
            }
        }
    }
}

int main()
{
    FILE* f=fopen("strmatch.in","r");
    FILE* g=fopen("strmatch.out","w");
    char sir1[255];
    fscanf(f,"%s",&sir1);
    char sir2[255];
    fscanf(f,"%s",&sir2);
    KMPSearch(sir1, sir2,g);
    return 0;
}