#include<iostream>
#include<cstdio>
#include<string.h>
#include<vector>
#define NMax 2000005
#define minim(a,b)((a>b)?b:a)
using namespace std;
int l[NMax],n;
char pattern[NMax],text[NMax];
std::vector<int> a;
void preKMP(char pattern[])
{
    l[1] = 0;
    int k = 0;
    for(int i=2;i<strlen(pattern);++i)
    {
        while(k>0 && pattern[k+1] != pattern[i])
            k = l[k];
        if(pattern[k+1]==pattern[i])k++;
        l[i] = k;
    }
}

void KMP(char pattern[],char text[])
{

}

int main()
{
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);
    cin>>(pattern+1)>>(text+1);
    //scanf("%s\n%s",&pattern,&text);
    pattern[0] = ' ';
    text[0] = ' ';

    preKMP(pattern);
    int k = 0;
    for(int i=1;i<strlen(text);++i)
    {
        while(k>0 && pattern[k+1] != text[i])
            k = l[k];
        if(pattern[k+1]==text[i])k++;
        if(k == strlen(pattern)-1)
        {
            ++n;
            if(n<999)a.push_back(i-k);
            k = l[k];
        }
    }

    printf("%d\n",n);
    for(int i=0;i<minim(n,a.size());++i)printf("%d ",a[i]);
}