#include <iostream>
#include <fstream>
#include <string.h>
#define NMAX 2000005
using namespace std;
ifstream f("strmatch.in");
ofstream g("strmatch.out");
int l1,l2,i,z[NMAX],sol,v[NMAX];
char s1[2*NMAX],s2[2*NMAX];

void zf(char p[])
{
    int l, r;
    int n = strlen(p+1);
    z[1] = 0;
    l = 0;
    r = 0;
    for(i = 1; i <= n; i++){
        if ( i <= r )
            z[i] = min(z[i - l + 1], r - i + 1);
        while( i + z[i] - 1 <= n && p[ i + z[i] ] == p[ z[i] + 1 ])
            z[i] ++;
        if(z[i] == l1){
            sol ++;
            if(sol <= 1000)
                v[sol] = i - l1 - 2;
        }

        if(i + z[i] - 1 >= r)
        {
            r = i + z[i] - 1;
            l = i;
        }
    }
}
int main()
{
    f.getline(s1+1, NMAX);
    f.getline(s2+1, NMAX);
    l1 = strlen(s1 + 1);
    l2 = strlen(s2 + 1);
    s1[l1 + 1] = '#';
    strcat(s1 + 1, s2 + 1);
    zf(s1);
    g << sol << '\n';
    sol = min(sol, 1000);
    for(i = 1; i <= sol; i++)
        g << v[i] << " ";
    return 0;
}