#include<iostream>
#include<fstream>
#include<string.h>
using namespace std;
ifstream f1("strmatch.in");
ofstream f2("strmatch.out");
#define MX 100010
#define B 128
const int prime= MX ;
int i,n,m, c[MX], nc ; // c - coada solutiilor
char a[MX],b[MX];

int f_hash(char s[], int st, int dr )
{
    int v=0;
    for (i=st; i<=dr; i++ )
        v= (v*B + s[i]) % prime;
    return v;
}

bool verifica(char s1[], int n, char s2[], int st )
{
    for (int i=0; i<=n; i++)
        if (s1[i] != s2[st+i] ) return 0;
    return 1;
}

void cauta_ap(char s1[], int n, char s2[], int m )
{
    long long v1= f_hash(s1,0,n), v=f_hash(s2,0,n), p=1, i ;

    for (i=1; i<=n; i++ )
        p= (p*B) % prime;

    for (i=n ; i<=m; i++ )
        {
            if (v==v1 )
                if (verifica(s1,n,s2,i-n ) )
                    c[++nc]=i-n;
            v= (p* (v- s2[i-n]*p + B*prime )+ s2[i+1] )%prime ;
        }
}

void test()
{
    cout<<f_hash(a,0,1)<<"\n";
    cout<<f_hash(b,1,2)<<"\n";
    cout<<verifica(a,n-2,b,2);
}

int main()
{
    f1>>a;
    f1>>b;
    n=strlen(a);
    m=strlen(b);

    cauta_ap(a,n-1, b,m-1);

   f2<<nc<<"\n";
    for (i=1; i<=nc; i++)
        f2<<c[i]<<" ";

    f2.close();
    return 0;
}