#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,m,contor;
char pattern[NMax],text[NMax];
std::vector<int> a;
void preKMP(char pattern[])
{
    l[1] = 0;
    int k = 0;
    for(int i=2;i<=m;++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);
    fgets(pattern, sizeof(pattern), stdin);
    fgets(text, sizeof(text), stdin);
    n = strlen(text)-1;
    m = strlen(pattern)-1;
    char aux[NMax];
    strcpy(aux,pattern);
    strcpy(pattern+1,aux);
    strcpy(aux,text);
    strcpy(text+1,aux);
    pattern[0] = ' ';
    text[0] = ' ';


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

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