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

vector<int>g;

char a[Max],b[Max];
int u[Max],n,nr;

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

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

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

    scanf("%s ",a);
    scanf("%s ",b);
    prefix();
   // for(int i=0;i<n;i++) printf("%d ",u[i]);
    kmp();
    printf("%d\n",nr);
    for(int i=0;i<g.size();i++) printf("%d ",g[i]);
    return 0;
}