#include<fstream>
#include<string.h>
#include<queue>
using namespace std;
#define MAX_LEN 2000005
int pi[MAX_LEN];
queue<int> q;
int M,N;
void computePi(char *str1)
{
    int k=0;
    pi[1]=0;
    for(int q=2;q<=N;q++)
    {
        while(k>0 && str1[k+1]!=str1[q])
            k=pi[k];
        if(str1[k+1]==str1[q])
            k++;
        pi[q]=k;
    }
}

int appearances(char *str1,char *str2)
{
    int ap=0;
    int k=0;
    for(int i=1;i<=N;i++) {
        while (k && str1[k + 1] != str2[i])
            k = pi[k];
        if (str1[k + 1] == str2[i])
            k++;
        if (k == M) {
           ap++;
            q.push(i-M);
            k = pi[k];
        }
    }
    return ap;
}
int main()
{
    fstream f,g;

    f.open("strmatch.in",ios::in);
    g.open("strmatch.out",ios::out);
    char str1[MAX_LEN];char str2[MAX_LEN];
    f>>str1>>str2;
    for (; (str1[M] >= 'A' && str1[M] <= 'Z') || (str1[M] >= 'a' && str1[M] <= 'z')
           || (str1[M] >= '0' && str1[M] <= '9'); ++M);
    for (; (str2[N] >= 'A' && str2[N] <= 'Z') || (str2[N] >= 'a' && str2[N] <= 'z')
           || (str2[N] >= '0' && str2[N] <= '9'); ++N);
    for(int i=M;i>0;i--) str1[i]=str1[i-1];
    str1[0]=' ';
    for(int i=N;i>0;i--) str2[i]=str2[i-1];
    str2[0]=' ';
    computePi(str1);

    int ap=appearances(str1,str2);
    g<<ap<<endl;
    while(!q.empty())
    {
        g<<q.front()<<" ";
        q.pop();
    }
}