#include <cstdio>
#include <vector>
using namespace std;
#define Max 2000001

char a[Max],b[Max];
int n,u[Max], nr;
vector<int>v;

void prefix(){
    int i,k = -1;
    u[0] = -1;
    for(int i=1;a[i] != '\0' && a[i] != '\n';i++)
    {
        n = i;
        while(k != -1 && a[k+1] != a[i])k = u[k];
        if( a[k+1] == a[i] )k++;
        u[i] = k;
    }
//    for(int i=0;i<=n;i++)printf("%d ",u[i]);
}

void kmp(){
    int i,k = -1;
    for(int i=0;b[i] != '\0' && b[i] != '\n';i++)
    {
        while(k != -1 && a[k+1] != b[i])k = u[k];
        if( a[k+1] == b[i] )k++;
        if( n == k )
        {
            nr++;
            if(nr <= 1000)v.push_back(i-k);
            k = u[k];
        }
    }
}

int main(){
    freopen("strmatch.in","r",stdin);
    freopen("strmatch.out","w",stdout);

        scanf("%s ",&a);
        scanf("%s ",&b);

    prefix();
    kmp();

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

    return 0;
}