#include <cstdio>
#include <algorithm>
#include<vector>
#include <cstring>
using namespace std;
vector<int> poz;
int pi[2000001];
char s1[2000001];
char s2[2000001];
void precomp(char s2[])
{
    int m=strlen(s2);
    int k=-1;
    pi[0]=0;
    for(int i=1;i<m;++i)
    {
        while(k>-1 &&s2[k+1]!=s2[i])
            k=pi[k];
        if(s2[k+1]==s2[i])
            ++k;
        pi[i]=k;
    }
}
void kmp(char s1[], char s2[])
{
    int n=strlen(s1);
    int m=strlen(s2);
    int q=-1;
    for(int i=0;i<n;++i)
    {
        while(q>-1&&s2[q+1]!=s1[i])
            q=pi[q];
        if(s1[i]==s2[q+1])
            ++q;
        if(q==m-1){
            poz.push_back(i-m+1);
            q=pi[q];}
    }
}
void citire()
{
    freopen("strmatch.in","r",stdin);
    scanf("%s",&s2);
    scanf("%s",&s1);
}
int main()
{
    citire();
    precomp(s2);
    kmp(s1,s2);
    freopen("strmatch.out","w",stdout);
    int sz=poz.size();
    printf("%d\n",sz);
    for(int i=0;i<sz;++i)
        printf("%d ",poz[i]);
    return 0;
}