#include <iostream>
#include <cstring>
#include <vector>
#include <fstream>
using namespace std;

const int MAXN = 2000000;

char A[MAXN+1], B[MAXN+1];
int nA, nB, T[MAXN+1];
vector <int> sol;

void kmp(char* A, char* B)
{
    for(int i = 1; i < nA; i++)
    {
        int j = T[i-1];
        while(A[j] != A[i])
        {
            j = T[j-1];
            if(j == 0)
                break;
        }
        if(j == 0 && A[0] == A[i])
            T[i] = 1;
        else
            T[i] = j + 1;
    }
    int i = 0;
    while(i < nB)
    {
        int j = 0;
        while(B[j+i] == A[j] && j < nA && j + i < nB)
            j++;
        if(j == nA)
            sol.push_back(i);
        if(T[j-1] == 0)
            i++;
        else
            i = i + j - T[j-1];
    }
}

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

    fgets(A, MAXN+1, stdin);
    fgets(B, MAXN+1, stdin);
    //in>>A>>B;
    nA = strlen(A) - 1;
    nB = strlen(B) - 1;
    kmp(A,B);
    printf("%d\n",sol.size());
    for(int i = 0; i < min(1000,(int)sol.size()); i++)
        printf("%d ",sol[i]);
    return 0;
}